Greedy Approximations of Independent Sets in Low Degree Graphs

@inproceedings{Halldrsson1995GreedyAO,
  title={Greedy Approximations of Independent Sets in Low Degree Graphs},
  author={Magn{\'u}s M. Halld{\'o}rsson and Kiyohito Yoshihara},
  booktitle={ISAAC},
  year={1995}
}
We investigate the power of a family of greedy algorithms for the independent set problem in cubic graphs and graphs of maximum degree three. These algorithm iteratively select vertices of minimum degree, but diier in the secondary rule for choosing among many candidates. We study three such algorithms, and prove tight performance ratios, with the best one being 9=7 1:28. All of these algorithms are practical and run in linear time, in contrast with the algorithm with the best performance ratio… CONTINUE READING