Rounding Via Miniatures

Bernd Gärtner () and Jiří Matoušek ()
Additional contact information
Bernd Gärtner: ETH Zurich, Institute of Theoretical Computer Science
Jiří Matoušek: Charles University, Department of Applied Mathematics

Chapter Chapter 13 in Approximation Algorithms and Semidefinite Programming, 2012, pp 211-227 from Springer

Abstract: Abstract The Goemans–Williamson semidefinite relaxation of MaxCut is quite simple. Still, as we have seen, analyzing it, and proving tight bounds on the integrality gap, is not an easy task. For other basic problems, such as Max-2-Sat or Max-3-Sat, semidefinite relaxations proposed in the literature are more sophisticated.

Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-22015-9_13

Ordering information: This item can be ordered from
http://www.springer.com/9783642220159

DOI: 10.1007/978-3-642-22015-9_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().