The Discrete and Mixed Minimax 2-Center Problem

DOI10.1007/978-3-319-26626-8_8zbMath1473.68207OpenAlexW2494556823MaRDI QIDQ3467837

Binhai Zhu, Yi Xu, Ji-Gen Peng, Yin-Feng Xu

Publication date: 5 February 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_8

zbMATH Keywords

computational geometryfarthest point Voronoi diagram2-center problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Streaming with minimum space: an algorithm for covering by two congruent balls
• Base station placement on boundary of a convex polygon
• The discrete 2-center problem
• A near-linear algorithm for the planar 2-center problem
• Facility location and the geometric minimum-diameter spanning tree.
• More planar two-center algorithms
• On the Complexity of Some Common Geometric Location Problems
• Finding tailored partitions
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Minimum Diameter Spanning Trees and Related Problems
• Semi-Online Maintenance of Geometric Optima and Measures