Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring.
Garud IyengarDavid J. PhillipsClifford SteinPublished in: IPCO (2005)
Keyphrases
- approximation algorithms
- graph coloring
- semidefinite
- packing problem
- bin packing
- semidefinite programming
- primal dual
- np hard
- higher dimensional
- combinatorial problems
- interior point methods
- job shop scheduling
- integer programming
- phase transition
- scheduling problem
- special case
- worst case
- constraint satisfaction problems
- max sat
- sufficient conditions
- convex relaxation
- linear programming
- convex sets
- optimal solution
- np complete
- lower bound
- graphical models
- constraint satisfaction
- constraint programming
- branch and bound algorithm
- job shop scheduling problem
- multistage
- search tree
- distance transform
- knapsack problem