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]
Abstract is missing.