An O\((n \log{}n)\) algorithm for a maxmin location problem (Q1192955): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:28, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O\((n \log{}n)\) algorithm for a maxmin location problem |
scientific article |
Statements
An O\((n \log{}n)\) algorithm for a maxmin location problem (English)
0 references
27 September 1992
0 references
maxmin location
0 references
obnoxious one-center problem
0 references
minimum Euclidean distance
0 references
