Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities.
Thomas AndreaeHans-Jürgen BandeltPublished in: SIAM J. Discret. Math. (1995)
Keyphrases
- approximation algorithms
- approximation guarantees
- np hard
- special case
- worst case
- vertex cover
- open shop
- approximation schemes
- facility location problem
- np hardness
- network design problem
- set cover
- minimum cost
- constant factor
- primal dual
- undirected graph
- planar graphs
- randomized algorithms
- polynomial time approximation
- mixed integer
- search algorithm
- knapsack problem
- linear program
- constant factor approximation