Christoph Lenzen, Roger Wattenhofer. Minimum Dominating Set Approximation in Graphs of Bounded Arboricity. In Nancy A. Lynch, Alexander A. Shvartsman, editors, Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Volume 6343 of Lecture Notes in Computer Science, pages 510-524, Springer, 2010. [doi]
@inproceedings{LenzenW10,
title = {Minimum Dominating Set Approximation in Graphs of Bounded Arboricity},
author = {Christoph Lenzen and Roger Wattenhofer},
year = {2010},
doi = {10.1007/978-3-642-15763-9_48},
url = {http://dx.doi.org/10.1007/978-3-642-15763-9_48},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LenzenW10},
cites = {0},
citedby = {0},
pages = {510-524},
booktitle = {Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings},
editor = {Nancy A. Lynch and Alexander A. Shvartsman},
volume = {6343},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-15762-2},
}