Optimal algorithms for constrained 1-center problems

DOI10.1007/978-3-642-54423-1_8MaRDI QIDQ5405030zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Stefan Langerman, Luis Barba

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54423-1_8

zbMATH Keywords

facility location problemsminimum enclosing circle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Recommendations

• Constrained minimum enclosing circle with center on a query line segment
• Constrained Minimum Enclosing Circle with Center on a Query Line Segment
• On enclosing k points by a circle
• Computing the smallest \(k\)-enclosing circle and related problems
• Some variations on constrained minimum enclosing circle problem

Cited in

(7)

• Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
• Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
• On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
• Optimizing over Consecutive 1's and Circular 1's Constraints
• Constrained minimum enclosing circle with center on a query line segment
• An algorithm and a core set result for the weighted Euclidean one-center problem
• Fast computation of smallest enclosing circle with center on a query line segment

This page was built for publication: Optimal algorithms for constrained 1-center problems

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