On approximation algorithms for the terminal Steiner tree problem.
Doratha E. DrakeStefan HougardyPublished in: Inf. Process. Lett. (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- prize collecting
- vertex cover
- network design problem
- facility location problem
- worst case
- minimum cost
- primal dual
- exact algorithms
- approximation ratio
- set cover
- randomized algorithms
- undirected graph
- disjoint paths
- constant factor
- approximation schemes
- computational complexity
- linear programming
- polynomial time approximation
- np hardness
- minimum spanning tree
- branch and bound