Approximation Algorithms for Clustering to Minimize the Sum of Diameters
- 1 January 2000
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 7 (3), 237-250
- https://doi.org/10.1007/3-540-44985-x_22
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Approximation algorithms for min-sum p-clusteringDiscrete Applied Mathematics, 1998
- Near-Linear Time Construction of Sparse Neighborhood CoversSIAM Journal on Computing, 1998
- An approximation algorithm for clustering graphs with dominating diametral pathInformation Processing Letters, 1997
- Incremental clustering and dynamic information retrievalPublished by Association for Computing Machinery (ACM) ,1997
- Dynamic programming and convex clusteringAlgorithmica, 1994
- Efficient parallel algorithms for geometric k-clustering problemsLecture Notes in Computer Science, 1994
- Geometric clusteringsJournal of Algorithms, 1991
- Optimal algorithms for approximate clusteringPublished by Association for Computing Machinery (ACM) ,1988
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981
- On the Complexity of Clustering ProblemsPublished by Springer Science and Business Media LLC ,1978