Randomized Rounding for Semidefinite Programs - Variations on the MAX CUT Example (1999)
| Venue: | of Lecture Notes in Computer Science |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Feige99randomizedrounding,
author = {Uriel Feige},
title = {Randomized Rounding for Semidefinite Programs - Variations on the MAX CUT Example},
booktitle = {of Lecture Notes in Computer Science},
year = {1999},
pages = {189--196},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. MAX CUT is the problem of partitioning the vertices of a graph into two sets, maximizing the number of edges joining these sets. Goemans and Williamson gave an algorithm that approximates MAX CUT within a ratio of 0.87856. Their algorithm first uses a semidefinite programming relaxation of MAX CUT that embeds the vertices of the graph on the surface of an n dimensional sphere, and then cuts the sphere in two at random. In this survey we shall review several variations of this algorithm which o#er improved approximation ratios for some special families of instances of MAX CUT, as well as for problems related to MAX CUT. 1 Introduction This survey covers an area of current active research. Hence, there is danger, or rather hope, that the survey will become outdated in the near future. The level of presentation will be kept informal. More details can be found in the references. Results are presented in a logical order that does not always correspond to the historical order in...
