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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gärtner, B., Matoušek, J. (2012). Introduction: MaxCut Via Semidefinite Programming. In: Approximation Algorithms and Semidefinite Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22015-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-22015-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22014-2
Online ISBN: 978-3-642-22015-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)