Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066)
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: Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem |
scientific article; zbMATH DE number 5576933
| 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; zbMATH DE number 5576933 |
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
