Approximation Algorithms for Facility Location Problems (Extended Abstract).
David B. ShmoysÉva TardosKaren AardalPublished in: STOC (1997)
Keyphrases
- extended abstract
- approximation algorithms
- facility location problem
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- primal dual
- open shop
- approximation ratio
- set cover
- constant factor
- network design problem
- randomized algorithms
- disjoint paths
- polynomial time approximation
- linear programming
- demand points
- constant factor approximation