Capacitated Domination: Problem Complexity and Approximation Algorithms.
Mong-Jen KaoHan-Lin ChenDer-Tsai LeePublished in: Algorithmica (2015)
Keyphrases
- approximation algorithms
- np hard
- worst case
- network design problem
- facility location problem
- np hardness
- special case
- computational complexity
- vertex cover
- approximation ratio
- set cover
- scheduling problem
- open shop
- approximation schemes
- constant factor
- vehicle routing problem
- minimum cost
- greedy algorithm
- lower bound
- randomized algorithms
- linear program
- approximation guarantees
- disjoint paths
- constant factor approximation
- multi item
- precedence constraints
- lagrangian relaxation
- primal dual
- parallel machines
- integer programming
- branch and bound algorithm
- error bounds
- constraint satisfaction problems