A faster dual algorithm for the Euclidean minimum covering ball problem

DOI10.1007/S10479-018-3123-5MaRDI QIDQ6880176zbMATH OpenFDO

Authors Marta Cavaleiro, Farid Alizadeh

Publication date 19 December 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-018-3123-5

zbMATH Keywords

1-centercomputational geometryminimum covering ballminmax locationsmallest enclosing ball

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computing methodologies and applications (68Uxx) Mathematical programming (90Cxx)

Cites work

• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
• Algorithms - ESA 2003
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• Approximate clustering via core-sets
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Efficient algorithms for the smallest enclosing ball problem
• scientific article; zbMATH DE number 1803755 (Why is no real title available?)
• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Linear Programming in Linear Time When the Dimension Is Fixed
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Location science research: a review
• Streaming algorithms for extent problems in high dimensions
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Two Algorithms for the Minimum Enclosing Ball Problem

This page was built for publication: A faster dual algorithm for the Euclidean minimum covering ball problem

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