Pages that link to "Item:Q818652"
From MaRDI portal
The following pages link to Approximation algorithms for a \(k\)-line center (Q818652):
Displaying 14 items.
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- Approximation algorithms for orthogonal line centers (Q831691) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- A near-linear algorithm for the planar 2-center problem (Q1364134) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033) (← links)
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- (Q3046493) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Approximation algorithms for orthogonal line centers (Q6166042) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)
