New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem.
Babak BehsazMohammad R. SalavatipourZoya SvitkinaPublished in: Algorithmica (2016)
Keyphrases
- approximation algorithms
- np hard
- special case
- single source
- vertex cover
- worst case
- network design problem
- randomized algorithms
- facility location problem
- minimum cost
- disjoint paths
- open shop
- primal dual
- approximation schemes
- np hardness
- precedence constraints
- constant factor
- set cover
- approximation ratio
- undirected graph
- exact algorithms
- job shop scheduling
- approximation guarantees
- scheduling problem
- genetic algorithm
- dynamic programming