Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Randomized algorithms
On the all-pairs-shortest-path problem in unweighted undirected graphs
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
All pairs shortest paths for graphs with small integer length edges
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
All pairs shortest distances for graphs with small integer length edges
Information and Computation
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
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
Approximate clustering via core-sets
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Introduction to Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
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
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On k-Median clustering in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
A Nearly Linear-Time Approximation Scheme for the Euclidean $k$-Median Problem
SIAM Journal on Computing
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Approximating average parameters of graphs
Random Structures & Algorithms
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Fast centrality approximation in modular networks
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
Linear-time approximation schemes for clustering problems in any dimensions
Journal of the ACM (JACM)
Routing betweenness centrality
Journal of the ACM (JACM)
Approximating betweenness centrality
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
On approximating metric 1-median in sublinear time
Information Processing Letters
| Hi-index | 5.23 |
A 1-median in a finite metric space is a point with the minimum average distance to all other points. Given a positive integer n and oracle access to a distance metric on {1,2,...,n}, we study the problem of finding a 1-median. In particular, we show the nonexistence of (1) deterministic O(1)-approximation o(n)-query algorithms, (2) deterministic (2-@W(1))-approximation o(n^2)-query algorithms for graph metrics, (3) deterministic (3-@W(1))-approximation o(n^2)-query algorithms and (4) Monte-Carlo (2-@W(1))-approximation o(n)-query algorithms with an @W(1) probability of success. We also show a Monte-Carlo (2+@e)-approximation O((log^2(1/@e))/@e^3)-query algorithm with a 1-O(@e) probability of success, where @e@?(0,1).