Approximation algorithms and semidefinite programming

Approximation algorithms and semidefinite programming

by Gärtner, Bernd

Type Book
Rate 0.0 /5
Details
Files
Reviews
Download

Title Statements

  • Full title :Approximation algorithms and semidefinite programming / Bernd Gärtner, Jiří Matoušek.

Edition Statements

  • Publication Date:©2012.

Publication Statements

  • Publisher(s):Springer
  • Place of Publication:Heidelberg
  • Language:eng
  • Publication Date:©2012.

The Physical Object

  • Description:xi, 251 pages : : illustrations ; : 24 cm

Edition Identifiers

  • ISBN:9783642220142, 3642220142
  • oclc:ocn733246610
  • LC Classification:QA76.9.A43
  • Dewey Decimal:518/.1

Table of Contents

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. Copositive programming -- 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.

Read More ↓

Subjects

Algorithmes Algorithmes d'approximation Approximation algorithms Programmation (Mathématiques) Programmation semi-définie Semidefinite programming

Writers

Gärtner, Bernd Matoušek, Jiří

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Approximation Algorithms and Semidefinite Program…

    PDF · 3.3 MB · updated
    Login →

  • Approximation Algorithms and Semidefinite Program…

    PDF · 2.2 MB · updated
    Login →

  • Approximation Algorithms and Semidefinite Program…

    PDF · 2.2 MB · updated
    Login →

  • Approximation Algorithms and Semidefinite Program…

    PDF · 3.5 MB · updated
    Login →