Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces
SIAM Journal on Optimization
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
| Hi-index | 0.89 |
This paper focuses on approximating the metric 1-median problem with sublinear number of queries and time complexity. We first show a simper proof of the currently best 4-approximation algorithm, and then propose a recursive algorithm. For any integer h=2, the algorithm finds a 2h-approximation solution with O(n^1^+^1^/^h) queries and time complexity.