New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem.
Babak BehsazMohammad R. SalavatipourZoya SvitkinaPublished in: SWAT (2012)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- single source
- facility location problem
- primal dual
- network design problem
- randomized algorithms
- approximation ratio
- set cover
- exact algorithms
- np hardness
- approximation schemes
- lower bound
- polynomial time approximation
- disjoint paths
- precedence constraints
- undirected graph
- constant factor
- simulated annealing