Approximation algorithms for the covering Steiner problem.
Goran KonjevodR. RaviAravind SrinivasanPublished in: Random Struct. Algorithms (2002)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- network design problem
- minimum cost
- facility location problem
- open shop
- approximation schemes
- set cover
- exact algorithms
- primal dual
- np hardness
- undirected graph
- approximation guarantees
- randomized algorithms
- polynomial time approximation
- combinatorial auctions
- linear programming
- scheduling problem
- computational complexity