Approximation algorithms and hardness results for the clique packing problem.
Frédéric ChataignerGordana ManicYoshiko WakabayashiRaphael YusterPublished in: Electron. Notes Discret. Math. (2007)
Keyphrases
- approximation algorithms
- packing problem
- np hard
- np hardness
- integer programming
- worst case
- bin packing
- special case
- np complete
- minimum cost
- vertex cover
- computational complexity
- lower bound
- optimal solution
- arbitrary shaped
- open shop
- approximation schemes
- set cover
- linear programming
- polynomial time approximation
- phase transition
- primal dual
- scheduling problem
- approximation ratio
- knapsack problem
- disjoint paths
- upper bound
- branch and bound algorithm
- objective function
- network flow
- undirected graph
- constant factor approximation