The following pages link to The discrete 2-center problem (Q1272957):
Displayed 17 items.
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- The mixed center location problem (Q1631666) (← links)
- Time-dependent green Weber problem (Q1651568) (← links)
- A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. (Q1853036) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
- The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
- Approximating the discrete center line segment in linear time (Q6139050) (← links)