Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2003.07.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1997857682 / rank | |||
Normal rank |
Revision as of 00:38, 20 March 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