The discrete 2-center problem
From MaRDI portal
Publication:1272957
DOI10.1007/PL00009387zbMath0910.68215OpenAlexW1992129184WikidataQ54309147 ScholiaQ54309147MaRDI QIDQ1272957
Ermo Welzl, Pankaj K. Agarwal, Micha Sharir
Publication date: 19 April 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009387
Related Items
The mixed center location problem ⋮ Time-dependent green Weber problem ⋮ The Discrete and Mixed Minimax 2-Center Problem ⋮ Discrete and mixed two-center problems for line segments ⋮ The Mixed Center Location Problem ⋮ Efficient algorithms for computing one or two discrete centers hitting a set of line segments ⋮ The discrete and mixed minimax 2-center problems ⋮ Approximating the discrete center line segment in linear time ⋮ Base station placement on boundary of a convex polygon ⋮ Facility location and the geometric minimum-diameter spanning tree. ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Parametric search: three new applications ⋮ Computing the Line-Constrained k-center in the Plane for Small k ⋮ A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM ⋮ A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. ⋮ On the planar two-center problem and circular hulls
