An O\((n \log{}n)\) algorithm for a maxmin location problem (Q1192955)
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: An O\((n \log{}n)\) algorithm for a maxmin location problem |
scientific article; zbMATH DE number 61826
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O\((n \log{}n)\) algorithm for a maxmin location problem |
scientific article; zbMATH DE number 61826 |
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
