Efficient algorithm for placing a given number of base stations to cover a convex region
- 1 November 2006
- journal article
- research article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 66 (11), 1353-1358
- https://doi.org/10.1016/j.jpdc.2006.05.004
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Covering algorithms, continuum percolation and the geometry of wireless networksThe Annals of Applied Probability, 2003
- A survey on sensor networksIEEE Communications Magazine, 2002
- Exposure in wireless Ad-Hoc sensor networksPublished by Association for Computing Machinery (ACM) ,2001
- Covering a rectangle with six and seven circlesDiscrete Applied Mathematics, 2000
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal CirclesExperimental Mathematics, 2000
- Efficient algorithms for geometric optimizationACM Computing Surveys, 1998
- The slab dividing approach to solve the EuclideanP-Center problemAlgorithmica, 1993
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981
- On the Least Number of Unit Circles Which Can Cover a SquareJournal of the London Mathematical Society, 1949