Approximation algorithms for hierarchical location problems.
C. Greg PlaxtonPublished in: STOC (2003)
Keyphrases
- approximation algorithms
- location problems
- np hard
- special case
- single facility
- worst case
- minimum cost
- vertex cover
- primal dual
- bicriteria
- approximation schemes
- approximation ratio
- set cover
- precedence constraints
- open shop
- constant factor
- combinatorial auctions
- genetic algorithm
- randomized algorithms
- upper bound
- disjoint paths
- constant factor approximation