Efficient algorithm for placing a given number of base stations to cover a convex region (Q861306)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithm for placing a given number of base stations to cover a convex region |
scientific article; zbMATH DE number 5083814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithm for placing a given number of base stations to cover a convex region |
scientific article; zbMATH DE number 5083814 |
Statements
Efficient algorithm for placing a given number of base stations to cover a convex region (English)
0 references
9 January 2007
0 references
base-station placement
0 references
covering region
0 references
Voronoi diagram
0 references
0.9202977418899536
0 references
0.8806753158569336
0 references
0.8086144328117371
0 references
0.7793253064155579
0 references
