Approximation algorithms for embedding general metrics into trees.
Mihai BadoiuPiotr IndykAnastasios SidiropoulosPublished in: SODA (2007)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- minimum cost
- facility location problem
- disjoint paths
- decision trees
- randomized algorithms
- set cover
- primal dual
- network design problem
- approximation ratio
- np hardness
- approximation schemes
- open shop
- exact algorithms
- undirected graph
- polynomial time approximation
- branch and bound algorithm
- upper bound