The following pages link to (Q2766839):
Displaying 14 items.
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- An approximation algorithm for \(k\)-center problem on a convex polygon (Q2015790) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
- Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
