Approximation algorithms for projective clustering

DOI10.1016/S0196-6774(02)00295-XzbMath1030.68107OpenAlexW2029432209MaRDI QIDQ4808316

Cecilia M. Procopiuc, Pankaj K. Agarwal

Publication date: 27 May 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00295-x

zbMATH Keywords

projective clustering problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (8)

Approximation algorithms for orthogonal line centers ⋮ Dynamic coresets ⋮ A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem ⋮ Unnamed Item ⋮ Core-Sets: Updated Survey ⋮ Approximation algorithms for orthogonal line centers ⋮ ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS ⋮ Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem

This page was built for publication: Approximation algorithms for projective clustering