Approximation algorithms for projective clustering
Authors:
- Pankaj K AgarwalPAPankaj K Agarwal
- Cecilia M ProcopiucCPCecilia M Procopiuc
- 1 February 2003
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 46 (2) , 115-139
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Efficient algorithms for geometric optimizationACM Computing Surveys, 1998
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- Approximation algorithms for geometric median problemsInformation Processing Letters, 1992
- Approximation algorithms for hitting objects with straight linesDiscrete Applied Mathematics, 1991
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Geometric complexity of some location problemsAlgorithmica, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- On the complexity of locating linear facilities in the planeOperations Research Letters, 1982