An O\((n \log{}n)\) algorithm for a maxmin location problem
type: Item
instance of: scholarly article
title: An O\((n \log{}n)\) algorithm for a maxmin location problem
zbMATH Open document ID: 0762.90045
DOI: 10.1016/0166-218X(92)90234-2
author: C. Pandu Rangan
author: Ramesh Govindan
published in: Discrete Applied Mathematics
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 61826
zbMATH Keywords: maxmin location
zbMATH Keywords: obnoxious one-center problem
zbMATH Keywords: minimum Euclidean distance
MaRDI profile type: Publication
cites work: Single Facility $l_p $-Distance Minimax Location
cites work: Computing largest empty circles with location constraints
full work available at URL: 0166-218x(92)90234-2
OpenAlex ID: W2070117653
Wikidata QID: Q126409527
description: scientific article; zbMATH DE number 61826