Approximation Algorithms for the Capacitated Domination Problem.
Mong-Jen KaoHan-Lin ChenPublished in: FAW (2010)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- facility location problem
- worst case
- minimum cost
- special case
- vertex cover
- primal dual
- linear programming
- randomized algorithms
- vehicle routing problem
- lot sizing
- set cover
- approximation schemes
- lower bound
- open shop
- scheduling problem
- computational complexity
- multi item
- approximation ratio
- routing problem
- optimal solution
- branch and bound algorithm
- np hardness
- constant factor
- combinatorial auctions
- network design
- approximation guarantees
- integer programming
- disjoint paths