Divide-and-conquer approximation algorithms via spreading metrics.
Guy EvenJoseph NaorSatish RaoBaruch SchieberPublished in: J. ACM (2000)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- network design problem
- approximation ratio
- approximation schemes
- constant factor
- primal dual
- open shop
- set cover
- combinatorial auctions
- exact algorithms
- undirected graph
- integer programming
- theoretical analysis
- randomized algorithms
- polynomial time approximation
- linear programming
- computational complexity
- genetic algorithm