Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.
Naveen GargRohit KhandekarPublished in: FOCS (2002)
Keyphrases
- related problems
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- primal dual
- set cover
- network design problem
- constant factor
- open shop
- exact algorithms
- facility location problem
- np hardness
- approximation ratio
- precedence constraints
- randomized algorithms
- polynomial time approximation
- undirected graph
- broadly applicable
- approximation schemes
- constant factor approximation
- integer programming