Approximating Maximum Independent Sets by Excluding Subgraphs (1992)
by
Ravi Boppana
,
Magnús M. Halldórsson
| Venue: | BIT |
| Citations: | 122 - 7 self |
BibTeX
@MISC{Boppana92approximatingmaximum,
author = {Ravi Boppana and Magnús M. Halldórsson},
title = {Approximating Maximum Independent Sets by Excluding Subgraphs},
year = {1992}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n/(log n)²). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems. The framework
