Efficient algorithm for placing a given number of base stations to cover a convex region (Q861306): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jpdc.2006.05.004 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2006.05.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023341506 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JPDC.2006.05.004 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:46, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithm for placing a given number of base stations to cover a convex region |
scientific article |
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
