Introduction: MaxCut Via Semidefinite Programming

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 1 in Approximation Algorithms and Semidefinite Programming, 2012, pp 3-14 from Springer

Abstract: Abstract Semidefinite programming is considered among the most powerful tools in the theory and practice of approximation algorithms. We begin our exposition with the Goemans–Williamson algorithm for the MaxCut problem (i.e., the problem of computing an edge cut with the maximum possible number of edges in a given graph). This is the first approximation algorithm (from 1995) based on semidefinite programming and it still belongs among the simplest and most impressive results in this area.

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_1

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

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

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 ().