• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Approximation Algorithms and Semidefinite Programming

Approximation Algorithms and Semidefinite Programming

Hardcover

General ComputersGeneral MathematicsProgramming

ISBN10: 3642220142
ISBN13: 9783642220142
Publisher: Springer Nature
Published: Jan 13 2012
Pages: 251
Weight: 1.10
Height: 0.80 Width: 6.10 Depth: 9.10
Language: English

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.

1 different editions

Also available

Also in

General Mathematics