Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. Halldórsson, M. M. & Radhakrishnan, J. Algorithmica, 18(1):145-163, 1997.
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
{"_id":{"_str":"525bb53a7e98fada74000138"},"__v":0,"authorIDs":[],"author_short":["Halldórsson, M. M.","Radhakrishnan, J."],"bibbaseid":"halldrsson-radhakrishnan-greedisgoodapproximatingindependentsetsinsparseandboundeddegreegraphs-1997","bibdata":{"html":"<div class=\"bibbase_paper\">\n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"dblp3366639\"> </a>Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs.</span>\n\t<span class=\"bibbase_paper_author\">\nHalldórsson, M. M.; and Radhakrishnan, J.</span>\n\t<!-- <span class=\"bibbase_paper_year\">1997</span>. -->\n</span>\n\n\n\n<i>Algorithmica</i>,\n\n18(1):145-163.\n\n 1997.\n\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n <!-- <i -->\n <!-- onclick=\"javascript:log_download('halldrsson-radhakrishnan-greedisgoodapproximatingindependentsetsinsparseandboundeddegreegraphs-1997', 'http://dx.doi.org/10.1007/BF02523693')\">DEBUG -->\n <!-- </i> -->\n\n <a href=\"http://dx.doi.org/10.1007/BF02523693\"\n onclick=\"javascript:log_download('halldrsson-radhakrishnan-greedisgoodapproximatingindependentsetsinsparseandboundeddegreegraphs-1997', 'http://dx.doi.org/10.1007/BF02523693')\">\n <img src=\"http://bibbase.org/img/filetypes/blank.png\"\n\t alt=\"Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs [.1007/BF02523693]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Paper</span></a> \n \n \n <a href=\"javascript:showBib('dblp3366639')\">\n <img src=\"http://bibbase.org/img/filetypes/bib.png\" \n\t alt=\"Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs [bib]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span></a>\n \n \n\n \n \n \n \n \n\n \n \n</span>\n\n<!-- -->\n\n</div>\n","downloads":0,"bibbaseid":"halldrsson-radhakrishnan-greedisgoodapproximatingindependentsetsinsparseandboundeddegreegraphs-1997","urls":{"Paper":"http://dx.doi.org/10.1007/BF02523693"},"role":"author","bibtex":"@article{ dblp3366639,\n title = {Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs},\n author = {Magnús M. Halldórsson and Jaikumar Radhakrishnan},\n author_short = {Halldórsson, M. M. and Radhakrishnan, J.},\n bibtype = {article},\n type = {article},\n year = {1997},\n key = {dblp3366639},\n id = {dblp3366639},\n biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/HalldorssonR97},\n url = {http://dx.doi.org/10.1007/BF02523693},\n journal = {Algorithmica},\n pages = {145-163},\n number = {1},\n volume = {18},\n text = {Algorithmica 18(1):145-163 (1997)}\n}","text":"Algorithmica 18(1):145-163 (1997)","volume":"18","number":"1","pages":"145-163","journal":"Algorithmica","url":"http://dx.doi.org/10.1007/BF02523693","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/HalldorssonR97","id":"dblp3366639","key":"dblp3366639","year":"1997","type":"article","bibtype":"article","author_short":["Halldórsson, M. M.","Radhakrishnan, J."],"author":["Magnús M. Halldórsson","Jaikumar Radhakrishnan"],"title":"Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs"},"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/HalldorssonR97","downloads":0,"search_terms":["greed","good","approximating","independent","sets","sparse","bounded","degree","graphs","halldórsson","radhakrishnan"],"title":"Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs","year":1997,"dataSources":["hruG4fqLCzpBrqN49"]}