Approximation algorithms for geometric median problems
Information Processing Letters
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Cluster analysis and mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for min-sum p-clustering
Discrete Applied Mathematics
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for a capacitated facility location problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact Algorithms and Approximation Schemes for Base Station Placement Problems
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
Polynomial time approximation schemes for base station coverage with minimum total radii
Computer Networks and ISDN Systems
On Optimizing Distance-Based Similarity Search for Biological Databases
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
Polynomial time approximation schemes for base station coverage with minimum total radii
Computer Networks: The International Journal of Computer and Telecommunications Networking
Subspace Discovery for Promotion: A Cell Clustering Approach
DS '09 Proceedings of the 12th International Conference on Discovery Science
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Online and incremental algorithms for facility location
ACM SIGACT News
| Hi-index | 0.00 |
We study the problem of clustering points in a metric space so as to minimize the sum of cluster diameters. Significantly improving on previous results, we present a primal-dual based constant factor approximation algorithm for this problem. We present a simple greedy algorithm that achieves a logarithmic approximation which also applies when the distance function is asymmetric. The previous best known result obtained a logarithmic approximation with a constant factor blowup in the number of clusters. We also obtain an incremental clustering algorithm that maintains a solution whose cost is at most a constant factor times that of optimal with a constant factor blowup in the number of clusters.