Efficient algorithm for placing a given number of base stations to cover a convex region
From MaRDI portal
Publication:861306
DOI10.1016/j.jpdc.2006.05.004zbMath1178.68028OpenAlexW2023341506MaRDI QIDQ861306
Gautam K. Das, Subhas C. Nandy, Bhabani P. Sinha, Sandip Das
Publication date: 9 January 2007
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.05.004
Related Items (6)
Optimal circle covering problems and their applications ⋮ Optimal 2-coverage of a polygonal region in a sensor network ⋮ The connected disk covering problem ⋮ On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls
This page was built for publication: Efficient algorithm for placing a given number of base stations to cover a convex region
