Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer. What can be approximated locally?: case study: dominating sets in planar graphs. In Friedhelm Meyer auf der Heide, Nir Shavit, editors, SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures, Munich, Germany, June 14-16, 2008. pages 46-54, ACM, 2008. [doi]
@inproceedings{LenzenOW08,
title = {What can be approximated locally?: case study: dominating sets in planar graphs},
author = {Christoph Lenzen and Yvonne Anne Oswald and Roger Wattenhofer},
year = {2008},
doi = {10.1145/1378533.1378540},
url = {http://doi.acm.org/10.1145/1378533.1378540},
tags = {case study, planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LenzenOW08},
cites = {0},
citedby = {0},
pages = {46-54},
booktitle = {SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures, Munich, Germany, June 14-16, 2008},
editor = {Friedhelm Meyer auf der Heide and Nir Shavit},
publisher = {ACM},
isbn = {978-1-59593-973-9},
}