An Efficient Geometric Solution to the Minimum Spanning Circle Problem

DOI10.1287/OPRE.35.1.80zbMATH Open0632.90020DBLPjournals/ior/Oommen87OpenAlexW2098079307WikidataQ60328325 ScholiaQ60328325MaRDI QIDQ3770262FDOQ3770262

Authors: 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

Recommendations

• A note on the $k$-minimum spanning tree problem on circles
• Computing the smallest \(k\)-enclosing circle and related problems
• On the geometry of the smallest circle enclosing a finite set of points
• scientific article; zbMATH DE number 3945378
• On the circle closest to a set of points

zbMATH Keywords

linear time complexityminimax locationminimum spanning circleefficient geometric solution

Mathematics Subject Classification ID

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

Cited In (4)

• A new algorithm for the minimax location problem with the closest distance
• A polynomial time algorithm for a hemispherical minimax location problem
• Title not available (Why is that?)
• Solution of an equiweighted minimax location problem on a hemisphere

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770262)