Approximation algorithms and hardness results for the clique packing problem.
Frédéric ChataignerGordana ManicYoshiko WakabayashiRaphael YusterPublished in: Discret. Appl. Math. (2009)
Keyphrases
- approximation algorithms
- packing problem
- np hard
- np hardness
- integer programming
- worst case
- special case
- bin packing
- minimum cost
- np complete
- vertex cover
- approximation ratio
- computational complexity
- optimal solution
- randomized algorithms
- scheduling problem
- set cover
- open shop
- primal dual
- lower bound
- linear programming
- arbitrary shaped
- approximation schemes
- constant factor
- precedence constraints
- greedy heuristic
- undirected graph
- branch and bound algorithm
- phase transition
- knapsack problem
- linear program
- approximation guarantees
- greedy algorithm