Covering a rectangle with six and seven circles

Authors:
J. B. M. Melissen;P. C. Schuur
Affiliations:
-;-
Venue:
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Year:
2000

Citing 0
Cited 4

Efficient algorithm for placing a given number of base stations to cover a convex region

Journal of Parallel and Distributed Computing
Covering a compact polygonal set by identical circles

Computational Optimization and Applications
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete

Computer Networks: The International Journal of Computer and Telecommunications Networking
Placing a given number of base stations to cover a convex region

IWDC'05 Proceedings of the 7th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract