2012

Approximation Algorithms and Semidefinite Programming

Authors:

ISBN: 978-3-642-22014-2 (Print) 978-3-642-22015-9 (Online)

Table of contents (13 chapters)

  1. Front Matter

    Pages i-xi

  2. Part I

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-14

      Introduction: MaxCut Via Semidefinite Programming

    3. No Access

      Book Chapter

      Pages 15-25

      Semidefinite Programming

    4. No Access

      Book Chapter

      Pages 27-43

      Shannon Capacity and Lovász Theta

    5. No Access

      Book Chapter

      Pages 45-73

      Duality and Cone Programming

    6. No Access

      Book Chapter

      Pages 75-98

      Approximately Solving Semidefinite Programs

    7. No Access

      Book Chapter

      Pages 99-118

      An Interior-Point Algorithm for Semidefinite Programming

    8. No Access

      Book Chapter

      Pages 119-130

      Copositive Programming

  3. Part II

    1. Front Matter

      Pages 131-131

    2. No Access

      Book Chapter

      Pages 133-155

      Lower Bounds for the Goemans–Williamson MaxCut Algorithm

    3. No Access

      Book Chapter

      Pages 157-166

      Coloring 3-Chromatic Graphs

    4. No Access

      Book Chapter

      Pages 167-177

      Maximizing a Quadratic Form on a Graph

    5. No Access

      Book Chapter

      Pages 179-191

      Colorings with Low Discrepancy

    6. No Access

      Book Chapter

      Pages 193-210

      Constraint Satisfaction Problems, and Relaxing Them Semidefinitely

    7. No Access

      Book Chapter

      Pages 211-227

      Rounding Via Miniatures

  4. Back Matter

    Pages 229-251