Work

Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING

Year: 1996

Type: conference-paper

Abstract: The best known approximation algorithm for graph MAX CUT, due to Goemans and Williamson, first finds the optimal solution a semidefinite program and then derives a graph cut from that solution.Building on this result, Karger, Motwani, and Sudan gave an approximation algorithm for graph coloring that also involves solving a semidefinite program.Solving these semidefinite programs using known methods (ellipsoid, interiorpoint ), though polynomial-time, is quite expensive.We show how they can be approximately solved in ~(nm) time for graphs with n nodes and m edges.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/237814.237980

Authors: Philip Klein, Hsueh-I Lu

Institution: Brown University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2010791033

FWCI: 0.799

Cites: 30

Cited by: 47

Related to: 10