Chapter: Semidefinite Programming

Click here to donate your five minutes and submit the table of contents of a book.

Search from the table of contents of 2.5 million books

Advanced Search (Beta)

Home > Approximation Algorithms and Semidefinite Programming > Semidefinite Programming

Approximation Algorithms and Semidefinite Programming |

Bernd Gärtner; Jiri Matousek

Springer Berlin Heidelberg

Semidefinite Programming

Chapter Info

Authors

Bernd Gärtner; Jiří Matoušek

ARI Id

1664824221629_3667908

Access

Not Available Free

Pages

15-25

DOI

10.1007/978-3-642-22015-9_2

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-22015-9_2

Chapters

entries per page

Filter:

Showing 0 to 0 of 0 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
No data available in table
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 0 to 0 of 0 entries

Books

entries per page

Filter:

Showing 0 to 0 of 0 entries

Book	Author(s)	Year	Publisher
No data available in table
Book	Author(s)	Year	Publisher

Showing 0 to 0 of 0 entries

Books

Book	Author(s)	Year	Publisher
Book	Author(s)	Year	Publisher

Articles

entries per page

Filter:

Showing 0 to 0 of 0 entries

Article Title	Authors	Journal	Vol Info	Language
No data available in table
Article Title	Authors	Journal	Vol Info	Language

Showing 0 to 0 of 0 entries

Articles

entries per page

Filter:

Showing 0 to 0 of 0 entries

Heading	Article Title	Authors	Journal	Vol Info
No data available in table
Heading	Article Title	Authors	Journal	Vol Info

Showing 0 to 0 of 0 entries

Articles

entries per page

Filter:

Showing 0 to 0 of 0 entries

Title	Author	Supervisor	Degree	Institute
No data available in table
Title	Author	Supervisor	Degree	Institute

Showing 0 to 0 of 0 entries

Table of Contents of Book

entries per page

Filter:

Showing 1 to 17 of 17 entries

Chapters/Headings	Author(s)	Pages	Info
Front Matter		i-xi
Front Matter		1-1
Introduction: MaxCut Via Semidefinite Programming	Bernd Gärtner; Jiří Matoušek	3-14
Semidefinite Programming	Bernd Gärtner; Jiří Matoušek	15-25
Shannon Capacity and Lovász Theta	Bernd Gärtner; Jiří Matoušek	27-43
Duality and Cone Programming	Bernd Gärtner; Jiří Matoušek	45-73
Approximately Solving Semidefinite Programs	Bernd Gärtner; Jiří Matoušek	75-98
An Interior-Point Algorithm for Semidefinite Programming	Bernd Gärtner; Jiří Matoušek	99-118
Copositive Programming	Bernd Gärtner; Jiří Matoušek	119-130
Front Matter		131-131
Lower Bounds for the Goemans–Williamson MaxCut Algorithm	Bernd Gärtner; Jiří Matoušek	133-155
Coloring 3-Chromatic Graphs	Bernd Gärtner; Jiří Matoušek	157-166
Maximizing a Quadratic Form on a Graph	Bernd Gärtner; Jiří Matoušek	167-177
Colorings with Low Discrepancy	Bernd Gärtner; Jiří Matoušek	179-191
Constraint Satisfaction Problems, and Relaxing Them Semidefinitely	Bernd Gärtner; Jiří Matoušek	193-210
Rounding Via Miniatures	Bernd Gärtner; Jiří Matoušek	211-227
Back Matter		229-251
Chapters/Headings	Author(s)	Pages	Info

Showing 1 to 17 of 17 entries

Similar Books

entries per page

Filter:

Showing 0 to 0 of 0 entries

Book	Author(s)	Year	Publisher
No data available in table
Book	Author(s)	Year	Publisher

Showing 0 to 0 of 0 entries

Similar Chapters

entries per page

Filter:

Showing 0 to 0 of 0 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
No data available in table
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 0 to 0 of 0 entries

Similar Thesis

entries per page

Filter:

Showing 0 to 0 of 0 entries

Title	Author	Supervisor	Degree	Institute
No data available in table
Title	Author	Supervisor	Degree	Institute

Showing 0 to 0 of 0 entries

Similar News

entries per page

Filter:

Showing 0 to 0 of 0 entries

Headline	Date	News Paper	Country
No data available in table
Headline	Date	News Paper	Country

Showing 0 to 0 of 0 entries