An O\((n \log{}n)\) algorithm for a maxmin location problem

DOI10.1016/0166-218X(92)90234-2zbMath0762.90045OpenAlexW2070117653WikidataQ126409527 ScholiaQ126409527MaRDI QIDQ1192955

Could not fetch data.

Publication date: 27 September 1992

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90234-2

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.