Distortion lower bounds for line embeddings

Authors:
Claire Mathieu;Charalampos Papamanthou
Affiliations:
Department of Computer Science, Brown University, P.O. Box 1910, Providence, RI, USA;Department of Computer Science, Brown University, P.O. Box 1910, Providence, RI, USA
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 1

Graphs with small bandwidth and cutwidth

Discrete Mathematics
Optimal embedding of complete binary trees into lines and grids

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Embedding tree metrics into low dimensional Euclidean spaces

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Low-distortion embeddings of general metrics into the line

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for low-distortion embeddings into low-dimensional spaces

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
D-width, metric embedding, and their connections

D-width, metric embedding, and their connections

Optimal distortion embedding of complete binary trees into lines

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certain structure. Using linear programming to formulate a simpler version of the problem gives an interesting intuition and direction concerning the computation of general lower bounds for distortion into the line. We also show that our lower bounds on special cases of metrics are a lot better than previous lower bounds.