Pages that link to "Item:Q2988724"
From MaRDI portal
The following pages link to Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724):
Displaying 10 items.
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- The coverage problem by aligned disks (Q2695288) (← 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)
- Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
- The Coverage Problem by Aligned Disks (Q6173214) (← links)
- A generalized \(k\)-means problem for clustering and an ADMM-based \(k\)-means algorithm (Q6536959) (← links)
- Variants of Euclidean \(k\)-center clusterings (Q6591472) (← links)
- The line-constrained maximum coverage facility location problem (Q6606204) (← links)