Approximation algorithms for hierarchical location problems.
C. Greg PlaxtonPublished in: J. Comput. Syst. Sci. (2006)
Keyphrases
- approximation algorithms
- location problems
- single facility
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- randomized algorithms
- open shop
- constant factor
- set cover
- bicriteria
- primal dual
- approximation ratio
- approximation schemes
- optimal solution
- disjoint paths
- ant colony optimization
- constraint satisfaction problems
- lower bound
- undirected graph
- scheduling problem