e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for geometric median problems
Information Processing Letters
How to allocate network centers
Journal of Algorithms
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Improved approximation algorithms for a capacitated facility location problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Capacitated K-Center Problem
SIAM Journal on Discrete Mathematics
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth 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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for facility location problems
Approximation algorithms for facility location problems
Algorithms for clustering problems
Algorithms for clustering problems
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for hierarchical location problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Clustering Large Graphs via the Singular Value Decomposition
Machine Learning
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
Distributed self-stabilizing placement of replicated resources in emerging networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences - Special issue on network algorithms 2005
A constant factor approximation algorithm for k-median clustering with outliers
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A plant location guide for the unsure
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
Facility Location Problems: A Parameterized View
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Maximum Gradient Embeddings and Monotone Clustering
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Median Topographic Maps for Biomedical Data Sets
Similarity-Based Clustering
Adaptive Sampling for k-Means Clustering
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Constructing treatment portfolios using affinity propagation
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Facility location problems: A parameterized view
Discrete Applied Mathematics
Fast clustering using MapReduce
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Locating depots for capacitated vehicle routing
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Constant factor approximation algorithm for the knapsack median problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Geometric clustering to minimize the sum of cluster sizes
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A note on scenario reduction for two-stage stochastic programs
Operations Research Letters
On the linear relaxation of the p-median problem
Discrete Optimization
On the p-median polytope of Y-free graphs
Discrete Optimization
Dense affinity propagation on clusters of GPUs
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Clustering under perturbation resilience
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
The effectiveness of lloyd-type methods for the k-means problem
Journal of the ACM (JACM)
SuperFloxels: a mid-level representation for video sequences
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
Data stability in clustering: a closer look
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
| Hi-index | 0.00 |
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are relatively close with respect to some measure. For the metric k-median problem, we are given n points in a metric space. We select k of these to be cluster centers and then assign each point to its closest selected center. If point j is assigned to a center i, the cost incurred is proportional to the distance between i and j. The goal is to select the k centers that minimize the sum of the assignment costs. We give a 62/3-approximation algorithm for this problem. This improves upon the best previously known result of O(log k log log k), which was obtained by refining and derandomizing a randomized O(log n log log n)-approximation algorithm of Bartal.