A Geometric Approach to Betweenness
SIAM Journal on Discrete Mathematics
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the impossibility of dimension reduction in l1
Journal of the ACM (JACM)
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for embedding general metrics into trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Geometrical realization of set systems and probabilistic communication complexity
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
ACM Transactions on Algorithms (TALG)
Betweenness parameterized above tight lower bound
Journal of Computer and System Sciences
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
| Hi-index | 0.00 |
This paper studies how to optimally embed a general metric, represented by a graph, into a target space while preserving the relative magnitudes of most distances. More precisely, in an ordinal embedding, we must preserve the relative order between pairs of distances (which pairs are larger or smaller), and not necessarily the values of the distances themselves. The relaxation of an ordinal embedding is the maximum ratio between two distances whose relative order is inverted by the embedding. We develop polynomial-time constant-factor approximation algorithms for minimizing the relaxation in an embedding of an unweighted graph into a line metric and into a tree metric. These two basic target metrics are particularly important for representing a graph by a structure that is easy to understand, with applications to visualization, compression, clustering, and nearest-neighbor searching. Along the way, we improve the best known approximation factor for ordinally embedding unweighted trees into the line down to 2. Our results illustrate an important contrast to optimal-distortion metric embeddings, where the best approximation factor for unweighted graphs into the line is O(n1/2), and even for unweighted trees into the line the best is $\tilde O(n^{1/3})$. We also show that Johnson-Lindenstrauss-type dimensionality reduction is possible with ordinal relaxation and 茂戮驴1metrics (and 茂戮驴pmetrics with 1 ≤ p≤ 2), unlike metric embedding of 茂戮驴1metrics.