An O\((n \log{}n)\) algorithm for a maxmin location problem (Q1192955): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q126409527, #quickstatements; #temporary_batch_1723583190453 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)90234-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070117653 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126409527 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:09, 13 August 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
