An Efficient Geometric Solution to the Minimum Spanning Circle Problem

DOI10.1287/opre.35.1.80zbMath0632.90020OpenAlexW2098079307WikidataQ60328325 ScholiaQ60328325MaRDI QIDQ3770262

B. John Oommen

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.1.80

zbMATH Keywords

minimax locationlinear time complexityminimum spanning circleefficient geometric solution

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Inventory, storage, reservoirs (90B05)

Related Items (3)

Solution of an equiweighted minimax location problem on a hemisphere ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ A polynomial time algorithm for a hemispherical minimax location problem

This page was built for publication: An Efficient Geometric Solution to the Minimum Spanning Circle Problem