Hardness results and approximation algorithms for (weighted) paired-domination in graphs.
Lei ChenChanghong LuZhenbing ZengPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- approximation algorithms
- np hard
- undirected graph
- np hardness
- worst case
- weighted graph
- special case
- vertex cover
- np complete
- minimum cost
- network design problem
- approximation guarantees
- facility location problem
- scheduling problem
- randomized algorithms
- graph model
- open shop
- set cover
- approximation schemes
- constant factor
- edge weights
- optimal solution
- lower bound
- primal dual
- combinatorial auctions
- weighted sum
- graph structure
- approximation ratio
- polynomial time approximation
- upper bound
- integer programming
- graph matching
- branch and bound algorithm
- constraint satisfaction problems
- learning algorithm
- precedence constraints
- phase transition
- minimum weight