Optimal Algorithms for Constrained 1-Center Problems
From MaRDI portal
Publication:5405030
DOI10.1007/978-3-642-54423-1_8zbMath1405.68397OpenAlexW2212129663MaRDI QIDQ5405030
Stefan Langerman, Prosenjit Bose, 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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)
Related Items (2)
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
This page was built for publication: Optimal Algorithms for Constrained 1-Center Problems