On the 2-Center Problem Under Convex Polyhedral Distance Function

DOI10.1007/978-3-319-48749-6_27zbMath1484.68271OpenAlexW2542281734MaRDI QIDQ2958331

Sergey Bereg

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_27

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Geometric complexity of some location problems
• Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints
• Linear Programming in Linear Time When the Dimension Is Fixed
• Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• On bisectors for different distance functions