Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem |
scientific article |
Statements
Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (English)
0 references
9 July 2009
0 references
algorithms
0 references
computational geometry
0 references
facility location
0 references
