Approximation algorithms and hardness for domination with propagation
Ashkan AazamiMichael D. StilpPublished in: CoRR (2007)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- vertex cover
- special case
- minimum cost
- facility location problem
- np complete
- primal dual
- approximation ratio
- disjoint paths
- approximation schemes
- network design problem
- exact algorithms
- set cover
- randomized algorithms
- constant factor
- lower bound
- open shop
- optimal solution
- precedence constraints
- greedy heuristic
- computational complexity
- knapsack problem
- branch and bound algorithm
- mathematical model
- constraint satisfaction problems
- linear programming
- upper bound
- polynomial time approximation