Nonlinear pattern matching in trees
Journal of the ACM (JACM)
Matching 2D patterns of protein spots
Proceedings of the fourteenth annual symposium on Computational geometry
The importance of being biased
STOC '02 Proceedings of the thiry-fourth 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
Lectures on Discrete Geometry
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On average distortion of embedding metrics into the line and into L1
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
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of low-distortion embeddings between point sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometry of Cuts and Metrics
Circular partitions with applications to visualization and embeddings
Proceedings of the twenty-fourth annual symposium on Computational geometry
Hi-index | 0.00 |
We improve hardness results for the problem of embedding one finite metric into another with minimum distortion. This problem is equivalent to optimally embedding one weighted graph into another under the shortest path metric. We show that unless P = NP, the minimum distortion of embedding one such graph into another cannot be efficiently approximated within a factor less than 9/4 even when the two graphs are unweighted trees. For weighted trees with the ratio of maximum edge weight to the minimum edge weight of α2 (α ≥ 1) and all but one node of constant degree, we improve this factor to 1+α. We also obtain similar hardness results for extremely simple line graphs (weighted). This improves and complements recent results of Kenyon et al.[13] and Papadimitriou and Safra [18].