A New Way of Using Semidefinite Programm
β
Gunnar Andersson; Lars Engebretsen; Johan HΓ₯stad
π
Article
π
2001
π
Elsevier Science
π
English
β 249 KB
We introduce a new method of constructing approximation algorithms for combinatorial optimization problems using semidefinite programming. It consists of expressing each combinatorial object in the original problem as a constellation of vectors in the semidefinite program. When we apply this techniq