What can be approximated locally?: case study: dominating sets in planar graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Christoph Lenzen' in GoogleThis author has not been identified. Look up 'Yvonne Anne Oswald' in GoogleThis author has not been identified. Look up 'Roger Wattenhofer' in Google

runs on WebDSL