Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal

@inproceedings{HALLD1994ImprovedAO,
  title={Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal},
  author={US M. HALLD},
  year={1994}
}
  • US M. HALLD
  • Published 1994
Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP -complete problem. We introduce an algorithm schema for improving the approximation of algorithms for this problem, which is based on preprocessing the input by removing cliques. We give an implementation of a theorem on the independence number of cliquefree graphs, and use it to obtain an O( = log log ) performance ratio with our schema. This is the rst o( ) ratio for the independent set problem. We… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

A note on the independence number of triangle-free graphs

Discrete Mathematics • 1983
View 5 Excerpts
Highly Influenced

Efficient bounds for the stable set, vertex cover and set packing problems

Discrete Applied Mathematics • 1983
View 8 Excerpts
Highly Influenced

On Tur an's theorem for sparse graphs

M. Ajtai, P. Erdos, J. Koml os, E. Szemer edi
1981
View 8 Excerpts
Highly Influenced

Derandomized graph products

computational complexity • 1995
View 1 Excerpt

Similar Papers

Loading similar papers…