Ittai Abraham
Arnold Filtser
ABSTRACT
We study the problem of embedding weighted graphs of pathwidth k into ℓp spaces. Our main result is an O(kmin{1p,12})-distortion embedding. For p=1, this is a super-exponential improvement over the best previous bound of Lee and Sidiropoulos. Our distortion bound is asymptotically tight for any fixed p >1.
Our result is obtained via a novel embedding technique that is based on low depth decompositions of a graph via shortest paths. The core new idea is that given a geodesic shortest path P, we can probabilistically embed all points into 2 dimensions with respect to P. For p>2 our embedding also implies improved distortion on bounded treewidth graphs (O((klogn)1p)). For asymptotically large p, our results also implies improved distortion on graphs excluding a minor.
Supplemental Material
- Ittai Abraham, Yair Bartal, and Ofer Neiman. 2011. Advances in metric embedding theory. Advances in Mathematics 228, 6 (2011), 3026 – 3126.Google Scholar
Cross Ref
- 1016/j.aim.2011.08.003Google Scholar
- Ittai Abraham, Shiri Chechik, Robert Krauthgamer, and Udi Wieder. 2015. Approximate Nearest Neighbor Search in Metrics of Planar Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA. 20–42.Google Scholar
- Ittai Abraham and Cyril Gavoille. 2006. Object location using path separators. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006. 188–197. STOC’18, June 25–29, 2018, Los Angeles, CA, USA Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman Google ScholarDigital Library
- Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar. 2014. Cops, robbers, and threatening skeletons: padded decomposition for minorfree graphs. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. 79–88. Google ScholarDigital Library
- Thomas Andreae. 1986. On a pursuit game played on graphs for which a minor is excluded. Journal of Combinatorial Theory, Series B 41, 1 (1986), 37 – 47. 8956(86)90026- 2 Google ScholarDigital Library
- P. Assouad. 1983. Plongements lipschitziens dans R n. Bull. Soc. Math. France 111, 4 (1983), 429–448.Google ScholarCross Ref
- Nikhil Bansal, Niv Buchbinder, Aleksander Madry, and Joseph Naor. 2011.Google Scholar
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on. 267 –276. Google ScholarDigital Library
- Yair Bartal, Douglas E. Carroll, Adam Meyerson, and Ofer Neiman. 2013. Bandwidth and low dimensional embedding. Theor. Comput. Sci. 500 (2013), 44–56. Google ScholarDigital Library
- Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson, and Ton Kloks. 1992.Google Scholar
- Approximating treewidth, pathwidth, and minimum elimination tree height. Springer Berlin Heidelberg, Berlin, Heidelberg, 1–12. 3- 540- 55121- 2_1Google Scholar
- Jean Bourgain. 1985. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math. 52, 1-2 (1985), 46–52.Google ScholarCross Ref
- N. L. Carothers. 2004.Google Scholar
- A Short Course on Banach Space Theory. Cambridge University Press.Google Scholar
- Amit Chakrabarti, Alexander Jaffe, James R. Lee, and Justin Vincent. 2008. Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA. 761–770. Google ScholarDigital Library
- Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair. 2006. Embedding k-outerplanar graphs into ℓ 1. SIAM J. Discrete Math. 20, 1 (2006), 119–136. Google ScholarDigital Library
- Anupam Gupta, Robert Krauthgamer, and James R. Lee. 2003. Bounded Geometries, Fractals, and Low-Distortion Embeddings. In FOCS ’03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Washington, DC, USA, 534. Google ScholarDigital Library
- Anupam Gupta, Amit Kumar, and Rajeev Rastogi. 2004. Traveling with a Pez dispenser (or, routing issues in MPLS). SIAM J. Comput. 34, 2 (2004), 453–474. Google ScholarDigital Library
- Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair. 2004. Cuts, Trees and ℓ 1 s-Embeddings of Graphs. Combinatorica 24, 2 (2004), 233–269. 004- 0015x Google ScholarDigital Library
- Anupam Gupta, Kunal Talwar, and David Witmer. 2013. On the Non-Uniform Sparsest Cut Problem on Bounded Treewidth Graphs. In Annual ACM Symposium on Theory of Computing. 281–290.Google Scholar
- Alexander Jaffe, James R. Lee, and Mohammad Moharrami. 2011. On the Optimality of Gluing over Scales. Discrete & Computational Geometry 46, 2 (01 Sep 2011), 270–282. 011- 9359- 3Google Scholar
- William b. Johnson and Gideon Schechtman. 2009.Google Scholar
- DIAMOND GRAPHS AND SUPER-REFLEXIVITY. Journal of Topology and Analysis 01, 02 (2009), 177–189.Google Scholar
- Lior Kamma and Robert Krauthgamer. 2016.Google Scholar
- Metric Decompositions of Path-Separable Graphs. Algorithmica (2016), 1–9. s00453- 016- 0213- 0Google Scholar
- Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, and Kunal Talwar. 2012.Google Scholar
- Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Computing 25, 3 (2012), 189–205. 012- 0157- 9Google Scholar
- Robert Krauthgamer, James R. Lee, Manor Mendel, and Assaf Naor. 2005. Measured descent: a new embedding method for finite metrics. Geometric and Functional Analysis 15, 4 (2005), 839–858. 005- 0527- 6Google ScholarCross Ref
- James R. Lee and Assaf Naor. 2004. Embedding the diamond graph in ℓ p and dimension reduction in ℓ 1. Geometric & Functional Analysis GAFA 14, 4 (2004), 745–747. 004- 0473- 8Google Scholar
- James R. Lee and Prasad Raghavendra. 2010. Coarse Differentiation and Multiflows in Planar Graphs. Discrete & Computational Geometry 43, 2 (2010), 346–362. 009- 9172- 4Google Scholar
- James R. Lee and Anastasios Sidiropoulos. 2010. Genus and the Geometry of the Cut Graph. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. 193–201. Google ScholarDigital Library
- James R. Lee and Anastasios Sidiropoulos. 2013.Google Scholar
- Pathwidth, trees, and random embeddings. Combinatorica 33, 3 (2013), 349–374. s00493- 013- 2685- 8 Google ScholarDigital Library
- 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 ScholarCross Ref
- Manor Mendel and Assaf Naor. 2013.Google Scholar
- Markov convexity and local rigidity of distorted metrics. Journal of the European Mathematical Society 15, 1 (2013), 287–337.Google Scholar
- Gary L. Miller. 1986.Google Scholar
- Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. J. Comput. Syst. Sci. 32, 3 (1986), 265–279. 0022- 0000(86)90030- 9Google Scholar
- Ilan Newman and Yuri Rabinovich. 2003.Google Scholar
- A lower bound on the distortion of embedding planar metrics into Euclidean space. Discrete Comput. Geom. 29, 1 (2003), 77–81. 002- 2813- 5Google Scholar
- Haruko Okamura and P.D. Seymour. 1981.Google Scholar
- Multicommodity flows in planar graphs. Journal of Combinatorial Theory, Series B 31, 1 (1981), 75 – 81. 8956(81)80012- 3Google Scholar
- Satish Rao. 1999. Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. In Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999. 300–306. Google ScholarDigital Library
- Yuval Shavitt and Tomer Tankel. 2004.Google Scholar
- Big-bang simulation for embedding network distances in Euclidean space. IEEE/ACM Trans. Netw. 12, 6 (2004), 993– 1006. Google ScholarDigital Library
- Mikkel Thorup. 2004.Google Scholar
- Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. J. ACM 51, 6 (Nov. 2004), 993–1024. Google ScholarDigital Library
Index Terms
- Metric embedding via shortest path decompositions
Recommendations
Metric Embedding via Shortest Path Decompositions
We study the problem of embedding shortest-path metrics of weighted graphs into $\ell_p$ spaces. We introduce a new embedding technique based on low-depth decompositions of a graph via shortest paths. The notion of shortest path decomposition (SPD) depth ...
The complexity of minimum-length path decompositions
We consider a bicriterion generalization of the pathwidth problem: given integers k , l and a graph G, does there exist a path decomposition of G of width at most k and length (i.e., number of bags) at most l__ __ We provide a complete complexity ...
Multiembedding of Metric Spaces
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how large the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion as a ...
Comments