Greed is good: approximating independent sets in sparse and bounded-degree graphs. Halldórsson, M. M. & Radhakrishnan, J. In Proceedings of Symposium on the Theory of Computing (STOC), pages 439-448, 1994.
Greed is good: approximating independent sets in sparse and bounded-degree graphs [link]Paper  bibtex   
@inproceedings{ dblp3511002,
  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 = {inproceedings},
  type = {inproceedings},
  year = {1994},
  key = {dblp3511002},
  id = {dblp3511002},
  biburl = {http://www.dblp.org/rec/bibtex/conf/stoc/HalldorssonR94},
  url = {http://doi.acm.org/10.1145/195058.195221},
  conference = {STOC},
  pages = {439-448},
  text = {STOC 1994:439-448},
  booktitle = {Proceedings of Symposium on the Theory of Computing (STOC)}
}

Downloads: 0