Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. Halldórsson, M. M. & Radhakrishnan, J. Algorithmica, 18(1):145-163, 1997.
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs [link]Paper  bibtex   
@article{ dblp3366639,
  title = {Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs},
  author = {Magnús M. Halldórsson and Jaikumar Radhakrishnan},
  author_short = {Halldórsson, M. M. and Radhakrishnan, J.},
  bibtype = {article},
  type = {article},
  year = {1997},
  key = {dblp3366639},
  id = {dblp3366639},
  biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/HalldorssonR97},
  url = {http://dx.doi.org/10.1007/BF02523693},
  journal = {Algorithmica},
  pages = {145-163},
  number = {1},
  volume = {18},
  text = {Algorithmica 18(1):145-163 (1997)}
}

Downloads: 0