Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Journal of Algorithms
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Quick and good facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
High-dimensional computational geometry
High-dimensional computational geometry
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Optimal Time Bounds for Approximate Clustering
Machine Learning
A local search approximation algorithm for k-means clustering
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Improved approximation algorithms for capacitated facility location problems
Mathematical Programming: Series A and B
Improved Combinatorial Algorithms for Facility Location Problems
SIAM Journal on Computing
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Approximation Algorithms for Metric Facility Location Problems
SIAM Journal on Computing
Smaller Coresets for k-Median and k-Means Clustering
Discrete & Computational Geometry
k-means++: the advantages of careful seeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Nearly Linear-Time Approximation Scheme for the Euclidean $k$-Median Problem
SIAM Journal on Computing
Approximating average parameters of graphs
Random Structures & Algorithms
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
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
Linear-time approximation schemes for clustering problems in any dimensions
Journal of the ACM (JACM)
Clustering for metric and nonmetric distance measures
ACM Transactions on Algorithms (TALG)
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Streaming k-means on well-clusterable data
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
On approximating metric 1-median in sublinear time
Information Processing Letters
| Hi-index | 0.89 |
Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding argmin"x"@?"M@?"y"@?"Md(x,y), breaking ties arbitrarily. We show that metric 1-median has a deterministic nonadaptive O(n^3^/^2)-time 4-approximation algorithm.