Approximation Algorithms and Semidefinite Programming

By Bernd Gartner and Bernd Gärtner

Book Overview

Part I (by Bernd G?rtner): 1 Introduction: MAXCUT via Semidefinite Programming.- 2 Semidefinite Programming.- 3 Shannon Capacity and Lov?sz Theta.- 4 Duality and Cone Programming.- 5 Approximately Solving Semidefinite Programs.- 6 An Interior-Point Algorithm for Semidefinite Programming.- 7 Compositive Programming.- Part II (by Jiri Matousek): 8 Lower Bounds for the Goemans-Williamson MAXCUT Algorithm .- 9 Coloring 3-Chromatic Graphs.- 10 Maximizing a Quadratic Form on a Graph.- 11 Colorings With Low Discrepancy.- 12 Constraint Satisfaction Problems, and Relaxing Them Semidefinitely.- 13 Rounding Via Miniatures.- Summary.- References.- Index.

• Format: Hardcover
• Language: English
• ISBN: 3642220142
• ISBN13: 9783642220142
• Release Date: January 2012
• Publisher: Springer
• Length: 251 Pages
• Weight: 1.10 lbs.
• Dimensions: 0.8" x 6.1" x 9.1"