Hardness results and approximation algorithms of k-tuple domination in graphs.
Ralf KlasingChristian LaforestPublished in: Inf. Process. Lett. (2004)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- undirected graph
- worst case
- special case
- vertex cover
- approximation ratio
- facility location problem
- set cover
- open shop
- approximation guarantees
- minimum cost
- network design problem
- directed graph
- polynomial time approximation
- approximation schemes
- computational complexity
- primal dual
- graph mining
- graph matching
- np complete
- constant factor approximation
- precedence constraints
- linear programming
- scheduling problem
- disjoint paths
- constant factor
- randomized algorithms
- bipartite graph
- planar graphs
- lower bound
- optimal solution