Approximation Algorithms and Hardness for Domination with Propagation.
Ashkan AazamiMichael D. StilpPublished in: APPROX-RANDOM (2007)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- vertex cover
- facility location problem
- np complete
- exact algorithms
- network design problem
- minimum cost
- randomized algorithms
- computational complexity
- set cover
- constant factor
- upper bound
- precedence constraints
- lower bound
- primal dual
- optimal solution
- approximation schemes
- open shop
- constant factor approximation
- undirected graph
- integer programming
- branch and bound algorithm
- polynomial time approximation
- linear programming