The following pages link to THE ALIGNED K-CENTER PROBLEM (Q2999091):
Displaying 13 items.
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- On the k-center problem with many centers (Q1824540) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- The coverage problem by aligned disks (Q2695288) (← 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)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Approximation algorithms for orthogonal line centers (Q6166042) (← links)
- The Coverage Problem by Aligned Disks (Q6173214) (← links)
- Variants of Euclidean \(k\)-center clusterings (Q6591472) (← links)
