Approximation algorithms and hardness results for cycle packing problems.
Michael KrivelevichZeev NutovMohammad R. SalavatipourJacques VerstraëteRaphael YusterPublished in: ACM Trans. Algorithms (2007)
Keyphrases
- approximation algorithms
- packing problem
- np hard
- np hardness
- integer programming
- worst case
- special case
- bin packing
- vertex cover
- minimum cost
- facility location problem
- np complete
- computational complexity
- phase transition
- set cover
- network design problem
- randomized algorithms
- primal dual
- branch and bound algorithm
- lower bound
- cutting stock
- approximation ratio
- combinatorial auctions
- open shop
- dc programming
- optimal solution
- knapsack problem
- linear programming
- upper bound
- precedence constraints
- approximation schemes
- scheduling problem
- search algorithm