Pages that link to "Item:Q4808316"
From MaRDI portal
The following pages link to Approximation algorithms for projective clustering (Q4808316):
Displaying 12 items.
- Approximation algorithms for orthogonal line centers (Q831691) (← links)
- Dynamic coresets (Q834605) (← links)
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem (Q2636610) (← links)
- Projected Gustafson-Kessel Clustering Algorithm and Its Convergence (Q3019860) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem (Q3627678) (← links)
- ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS (Q4931731) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465864) (← links)
- (Q5743480) (← links)
- Subtrajectory clustering: finding set covers for set systems of subcurves (Q5881551) (← links)
- Approximation algorithms for orthogonal line centers (Q6166042) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)