Facility location and the geometric minimum-diameter spanning tree.

DOI10.1016/j.comgeo.2003.07.007zbMath1038.65014OpenAlexW2105865143MaRDI QIDQ1421033

Sang-Min Park, Joachim Gudmundsson, Alexander Wolff, Chan-Su Shin, Herman J. Haverkort

Publication date: 23 January 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/24413

zbMATH Keywords

algorithmfacility locationcomputational geometrydata structurediscrete minimum-sum-two-center problemminimum-diameter spanning tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

The Discrete and Mixed Minimax 2-Center Problem ⋮ Euclidean chains and their shortcuts ⋮ The discrete and mixed minimax 2-center problems ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ Farthest-point queries with geometric and combinatorial constraints

Cites Work

• On the minimum diameter spanning tree problem
• The discrete 2-center problem
• Dynamic half-space range reporting and its applications
• Minimum Diameter Spanning Trees and Related Problems
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item