Abstract
Given metric spaces (X, DX) and (Y, DY), an embedding F: X → Y is an injective mapping from X to Y. Expansion eF and contraction cF of an embedding F: X → Y are defined as
eF = maxx;1, x2 (≠ x1) ∈ X DY(F(x1), F(x2))/ DX(x1, x2) and cF = maxx1, x2 (≠ x1) ∈ X DX(x1, x2)/DY(F(x1), F(x2)),
respectively, and distortion dF is defined as dF= eF ⋅ cF. Observe that dF ≥ 1. An embedding F : X → Y is noncontracting if cF ≤ 1. When d=1, then F is isometry.
The Metric Embedding problem takes as input two metric spaces (X,DX) and (Y,DY), and a positive integer d. The objective is to determine whether there is an embedding F: X → Y such that dF ≤ d. Such an embedding is called a distortion d embedding. The bijective Metric Embedding problem is a special case of the Metric Embedding problem where ∣X∣ = ∣Y∣. In parameterized complexity, the Metric Embedding problem, in full generality, is known to be W-hard and, therefore, not expected to have an FPT algorithm. In this article, we consider the Gen-Graph Metric Embedding problem, where the two metric spaces are graph metrics. We explore the extent of tractability of the problem in the parameterized complexity setting. We determine whether an unweighted graph metric (G,DG) can be embedded, or bijectively embedded, into another unweighted graph metric (H,DH), where the graph H has low structural complexity. For example, H is a cycle, or H has bounded treewidth or bounded connected treewidth. The parameters for the algorithms are chosen from the upper bound d on distortion, bound Δ on the maximum degree of H, treewidth α of H, and connected treewidth αc of H.
Our general approach to these problems can be summarized as trying to understand the behavior of the shortest paths in G under a low-distortion embedding into H, and the structural relation the mapping of these paths has to shortest paths in H.
- I. Abraham, Y. Bartal, and O. Neiman. 2011. Advances in metric embedding theory. Advances in Mathematics 228, 6 (2011), 3026--3126.Google Scholar
Cross Ref
- M. Badoiu, J. Chuzhoy, P. Indyk, and A. Sidiropoulos. 2005. Low-distortion embeddings of general metrics into the line. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC’05). 225--233.Google Scholar
- M. Badoiu, K. Dhamdhere, A. Gupta, Y. Rabinovich, H. Räcke, R. Ravi, and A. Sidiropoulos. 2005. Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’05). 119--128.Google Scholar
- Y. Bartal. 1996. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS’96). 184--193.Google Scholar
Digital Library
- J. Bourgain. 1985. On Lipschitz embedding of finite metric spaces in hilbert space. Israel Journal of Mathematics 52, 1--2 (1985), 46--52.Google Scholar
Cross Ref
- T. Carpenter, F. V. Fomin, D. Lokshtanov, S. Saurabh, and A. Sidiropoulos. 2017. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR abs/1712.06747 (2017). http://arxiv.org/abs/1712.06747.Google Scholar
- T. Carpenter, F. V. Fomin, D. Lokshtanov, S. Saurabh, and A. Sidiropoulos. 2018. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. In Proceedings of the 34th International Symposium on Computational Geometry (SoCG’18). 21:1--21:14.Google Scholar
- M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. [n.d.]. Parameterized Algorithms. Springer.Google Scholar
- R. Diestel and M. Müller. 2017. Connected tree-width. Combinatorica 38, 2 (2017), 381--398.Google Scholar
Digital Library
- J. Fakcharoenphol, S. Rao, and K. Talwar. 2003. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC’03). 448--455.Google Scholar
- M. R. Fellows, F. V. Fomin, D. Lokshtanov, E. Losievskaja, F. A. Rosamond, and S. Saurabh. 2013. Distortion is fixed parameter tractable. ACM Transactions on Computation Theory 5, 4 (2013), 16:1--16:20.Google Scholar
Digital Library
- J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer.Google Scholar
- A. Gupta, R. Krauthgamer, and J. R. Lee. 2003. Bounded geometries, fractals, and low-distortion embeddings. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS’03). 534--543.Google Scholar
- A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. 2004. Cuts, trees and l1-embeddings of graphs. Combinatorica 24, 2 (2004), 233--269.Google Scholar
Digital Library
- P. Indyk. 2001. Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS’01). 10--33.Google Scholar
Cross Ref
- W. Johnson and J. Lindenstrauss. 1984. Extensions of Lipschitz mappings into a Hilbert space. In Conference in Modern Analysis and Probability (New Haven, Conn., 1982). Contemporary Mathematics, Vol. 26. American Mathematical Society, 189--206.Google Scholar
- C. Kenyon, Y. Rabani, and A. Sinclair. 2010. Low distortion maps between point sets. SIAM Journal on Computing 39, 4 (2010), 1617--1636.Google Scholar
Cross Ref
- N. Linial, E. London, and Y. Rabinovich. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 2 (1995), 215--245.Google Scholar
Cross Ref
- J. Matoušek. 2013. Lecture Notes on Metric Embeddings. Retrieved from http://kam.mff.cuni.cz/ matousek/ba-a4.pdf.Google Scholar
- A. Nayyeri and B. Raichel. 2015. Reality distortion: Exact and approximate algorithms for embedding into the line. In Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS’15). 729--747.Google Scholar
- A. Nayyeri and B. Raichel. 2017. A treehouse with custom windows: Minimum distortion embeddings into bounded treewidth graphs. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’17). 724--736.Google Scholar
Index Terms
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
Recommendations
Embedding k-Outerplanar Graphs into l1
We show that the shortest-path metric of any $k$-outerplanar graph, for any fixed $k$, can be approximated by a probability distribution over tree metrics with constant distortion and hence also embedded into $\ell_1$ with constant distortion. These ...
Metric Embeddings with Relaxed Guarantees
We consider the problem of embedding finite metrics with slack: We seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by ...
Low complexity algorithms for linear recurrences
ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computationWe consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are hypergeometric over ...






Comments