Approximating Geometric Coverage Problems

Additional Metadata
THEME	Logistics (theme 3)
Publisher	SIAM
Conference	ACM-SIAM Symposium on Discrete Algorithms
Organisation	Networks and Optimization
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Erlebach, T.& van Leeuwen, E. J. (2008). Approximating Geometric Coverage Problems. Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 1267–1276.

See Also
inProceedings Domination in Geometric Intersection Graphs T. Erlebach (Thomas) and E.J. van Leeuwen (Erik Jan)
inProceedings Domination in Geometric Intersection Graphs T. Erlebach (Thomas) and E.J. van Leeuwen (Erik Jan)

Publication