@InProceedings{chauhan_et_al:LIPIcs.FSTTCS.2016.33,
author = {Chauhan, Ankit and Friedrich, Tobias and Rothenberger, Ralf},
title = {{Greed is Good for Deterministic Scale-Free Networks}},
booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)},
pages = {33:1--33:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-027-9},
ISSN = {1868-8969},
year = {2016},
volume = {65},
editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.33},
URN = {urn:nbn:de:0030-drops-68682},
doi = {10.4230/LIPIcs.FSTTCS.2016.33},
annote = {Keywords: random graphs, power-law degree distribution, scale-free networks, PLB networks, approximation algorithms, vertex cover, dominating set, independent s}
}