NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.076 seconds)

Spelling suggestions: "subject:"combinatorialoptimization"" "subject:"combinatorialoptimation""

1

Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph

Khani, Mohammad Reza Unknown Date
No description available.
Theory of Computation
Approximation Algorithms
Hardness of Approximation
CombinatorialOptimization

Page generated in 0.0786 seconds