Approximation Algorithms for the Capacitated Domination Problem
Mong-Jen KaoHan-Lin ChenPublished in: CoRR (2010)
Keyphrases
- approximation algorithms
- network design problem
- facility location problem
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- multi item
- primal dual
- routing problem
- lot sizing
- np hardness
- set cover
- approximation ratio
- constant factor
- scheduling problem
- undirected graph
- lower bound
- integer programming
- linear programming
- polynomial time approximation
- approximation schemes
- facility location
- disjoint paths