Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings > Semidefinite Programming and Approximation Algorithms: A Survey
Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings |
Haim Kaplan
Springer Berlin Heidelberg
Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings
Semidefinite Programming and Approximation Algorithms: A Survey
Authors

Sanjeev Arora

ARI Id

1664720399369_2914350

Access

Not Available Free

Pages

25-25

DOI

10.1007/978-3-642-13731-0_3

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-13731-0_3

Table of Contents of Book
Showing 1 to 20 of 41 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Optimal Exploration of Terrains with Obstacles
Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Andrzej Pelc
1-12
Reconstructing a Simple Polygon from Its Angles
Yann Disser; Matúš Mihalák; Peter Widmayer
13-24
Semidefinite Programming and Approximation Algorithms: A Survey
Sanjeev Arora
25-25
Strictly-Regular Number System and Data Structures
Amr Elmasry; Claus Jensen; Jyrki Katajainen
26-37
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
Prosenjit Bose; Karim Douïeb; Vida Dujmović; Rolf Fagerberg
38-49
The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
Jie Gao; Dengpan Zhou
50-61
A Bottom-Up Method and Fast Algorithms for max independent set
Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij
62-73
Capacitated Domination Faster Than O(2 n )
Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk
74-80
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
Stefan Kratsch; Pascal Schweitzer
81-92
On Feedback Vertex Set New Measure and New Structures
Yixin Cao; Jianer Chen; Yang Liu
93-104
Conflict-Free Coloring Made Stronger
Elad Horev; Roi Krakovski; Shakhar Smorodinsky
105-117
Polychromatic Coloring for Half-Planes
Shakhar Smorodinsky; Yelena Yuditsky
118-126
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
Zhou Xu; Brian Rodrigues
127-138
Minimum and Maximum against k Lies
Michael Hoffmann; Jiří Matoušek; Yoshio Okamoto; Philipp Zumstein
139-149
Feasible and Accurate Algorithms for Covering Semidefinite Programs
Garud Iyengar; David J. Phillips; Cliff Stein
150-162
The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms
Prabhakar Raghavan
163-163
Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average
Robert Crowston; Gregory Gutin; Mark Jones; Eun Jung Kim; Imre Z. Ruzsa
164-175
Capacitated max -Batching with Interval Graph Compatibilities
Tim Nonner
176-187
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Imran A. Pirwani; Mohammad R. Salavatipour
188-199
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 41 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings