A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem.
Gautier StaufferGuillaume MassonnetChristophe RapineJean-Philippe GayonPublished in: SODA (2011)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- primal dual
- worst case
- approximation schemes
- facility location problem
- set cover
- approximation ratio
- open shop
- data warehouse
- precedence constraints
- network design problem
- np hardness
- supply chain
- constant factor
- approximation guarantees
- randomized algorithms
- optimal solution
- constant factor approximation
- undirected graph
- linear program
- computational complexity