Competitive algorithms for server problems
Journal of Algorithms
On the second eigenvalue of a graph
Discrete Mathematics
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Lower Bounds for Randomized $k$-Serverand Motion-Planning Algorithms
SIAM Journal on Computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
SIAM Journal on Computing
Multi-embedding and path approximation of metric spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Low dimensional embeddings of ultrametrics
European Journal of Combinatorics
Dimension reduction for ultrametrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server algorithms for growth-rate bounded graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A tight threshold for metric Ramsey phenomena
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server algorithms for growth-rate bounded graphs
Journal of Algorithms
Local versus global properties of metric spaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Computer Science Review
The k-resource problem in uniform metric spaces
Theoretical Computer Science
The k-resource problem on uniform and on uniformly decomposable metric spaces
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
This paper deals with Ramsey-type theorems for metric spaces. Such a theorem states that every n point metric space contains a large subspace which can be embedded with some fixed distortion in a metric space from some special class.Our main theorem states that for any ε0, every n point metric space contains a subspace of size at least n1-ε which is embeddable in an ultrametric with O(log(1/ε)/ε distortion. This in particular provides a bound for embedding in Euclidean spaces. The bound on the distortion is tight up to the log(1/ε) factor even for embedding in arbitrary Euclidean spaces. This result can be viewed as a non-linear analog of Dvoretzky's theorem, a cornerstone of modern Banach space theory and convex geometry.Our main Ramsey-type theorem and techniques naturally extend to give theorems for classes of hierarchically well-separated trees which have algorithmic implications, and can be viewed as the solution of a natural clustering problem.We further include a comprehensive study of various other aspects of the metric Ramsey problem.