Approximation Algorithms and Hardness for Domination with Propagation.
Ashkan AazamiKael StilpPublished in: SIAM J. Discret. Math. (2009)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- vertex cover
- facility location problem
- minimum cost
- open shop
- computational complexity
- randomized algorithms
- approximation schemes
- network design problem
- np complete
- approximation ratio
- linear programming
- primal dual
- upper bound
- lower bound
- precedence constraints
- constant factor
- constant factor approximation
- undirected graph
- greedy algorithm
- information theoretic
- exact algorithms
- integer program
- combinatorial auctions
- phase transition
- branch and bound algorithm
- error bounds
- linear program
- scheduling problem
- objective function