An O\((n \log{}n)\) algorithm for a maxmin location problem (Q1192955): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Single Facility $l_p $-Distance Minimax Location / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing largest empty circles with location constraints / rank | |||
Normal rank | |||
Latest revision as of 12:41, 16 May 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
