Covering a line segment with variable radius discs
- 1 May 2009
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (5) , 1423-1436
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- A geometric theorem for network designIEEE Transactions on Computers, 2004
- Coverage in wireless ad hoc sensor networksIEEE Transactions on Computers, 2003
- The art gallery theorem for polygons with holes2002
- Coverage problems in wireless ad-hoc sensor networks2002
- Locating New Stops in a Railway Network1 1This work was partially supported by the Human Potential Programme of the European Union under contract no. HPRN-CT-1999-00104 (AMORE).Electronic Notes in Theoretical Computer Science, 2001
- Almost optimal set covers in finite VC-dimensionDiscrete & Computational Geometry, 1995
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975