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