Terminal embeddings

In this paper we study terminal embeddings, in which one is given a finite metric (X, dX) (or a graph G = (V,E)) and a subset K ⊆ X of its points are designated as terminals. The objective is to embed the metric into a normed space, while approximately preserving all distances among pairs that contain a terminal. We devise such embeddings in various settings, and conclude that even though we have to preserve ≈ |K| · |X| pairs, the distortion depends only on |K|, rather than on |X|. We also strengthen this notion, and consider embeddings that approximately preserve the distances between all pairs, but provide improved distortion for pairs containing a terminal. Surprisingly, we show that such embeddings exist in many settings, and have optimal distortion bounds both with respect to X ×X and with respect to K ×X. Moreover, our embeddings have implications to the areas of Approximation and Online Algorithms. In particular, [7] devised an Õ( √ log r)-approximation algorithm for sparsest-cut instances with r demands. Building on their framework, we provide an Õ( √ log |K|)-approximation for sparsest-cut instances in which each demand is incident on one of the vertices of K (aka, terminals). Since |K| ≤ r, our bound generalizes that of [7]. 1998 ACM Subject Classification G.2.2 Graph algorithms

[1]  James R. Lee,et al.  Fréchet Embeddings of Negative Type Metrics , 2007, Discret. Comput. Geom..

[2]  James R. Lee,et al.  Euclidean distortion and the sparsest cut , 2005, STOC '05.

[3]  Uriel Feige,et al.  Interchanging distance and capacity in probabilistic mappings , 2009, ArXiv.

[4]  Oktay Günlük,et al.  A New Min-Cut Max-Flow Ratio for Multicommodity Flows , 2002, SIAM J. Discret. Math..

[5]  J. Matousek,et al.  On the distortion required for embedding finite metric spaces into normed spaces , 1996 .

[6]  Yair Bartal.  Graph Decomposition Lemmas and Their Role in Metric Embedding Methods , 2004, ESA.

[7]  Shang-Hua Teng,et al.  Lower-stretch spanning trees , 2004, STOC '05.

[8]  Ittai Abraham,et al.  Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion , 2007, SODA '07.

[9]  Michael Elkin,et al.  Terminal Embeddings , 2015, APPROX-RANDOM.

[10]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[11]  Robert Krauthgamer,et al.  Vertex Sparsifiers: New Results from Old Techniques , 2010, SIAM J. Comput..

[12]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[13]  Michael Elkin,et al.  Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[14]  Michael Elkin,et al.  Prioritized Metric Structures and Embedding , 2015, STOC.

[15]  Assaf Naor,et al.  Ramsey partitions and proximity data structures , 2006, FOCS.

[16]  Ankur Moitra,et al.  Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Frank Thomson Leighton,et al.  Vertex Sparsifiers and Abstract Rounding Algorithms , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[18]  T. Figiel,et al.  The dimension of almost spherical sections of convex bodies , 1976 .

[19]  Noga Alon,et al.  A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[20]  Robert Krauthgamer,et al.  Cutting Corners Cheaply, or How to Remove Steiner Points , 2015, SIAM J. Comput..

[21]  Ittai Abraham,et al.  Nearly Tight Low Stretch Spanning Trees , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[22]  LeightonTom,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999 .

[23]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[24]  Ittai Abraham,et al.  Using petal-decompositions to build a low stretch spanning tree , 2012, STOC '12.

[25]  Harald Räcke,et al.  Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.

[26]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[27]  Piotr Indyk,et al.  Euclidean spanners in high dimensions , 2013, SODA.

[28]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[29]  R. Ravi,et al.  An improved approximation algorithm for requirement cut , 2010, Oper. Res. Lett..

[30]  Robert Krauthgamer,et al.  Measured descent: a new embedding method for finite metrics , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[31]  Michael Elkin,et al.  Sparse source-wise and pair-wise distance preservers , 2005, SODA '05.

[32]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[33]  Jon M. Kleinberg,et al.  Metric embeddings with relaxed guarantees , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[34]  Ittai Abraham,et al.  Advances in metric embedding theory , 2006, STOC '06.

[35]  Telikepalli Kavitha,et al.  Small Stretch Pairwise Spanners , 2013, ICALP.

[36]  Andréa W. Richa,et al.  A Tight Lower Bound for the Steiner Point Removal Problem on Trees , 2006, APPROX-RANDOM.

[37]  Mikkel Thorup,et al.  Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.

[38]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[39]  K. Chao,et al.  Steiner Minimal Trees , 2005 .

[40]  Anupam Gupta,et al.  Steiner points in tree metrics don't (really) help , 2001, SODA '01.

[41]  Konstantin Makarychev,et al.  Metric extension operators, vertex sparsifiers and Lipschitz extendability , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[42]  Jon M. Kleinberg,et al.  Triangulation and embedding using small sets of beacons , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[43]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[44]  Nathan Linial,et al.  Some Low Distortion Metric Ramsey Problems , 2005, Discret. Comput. Geom..

[45]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[46]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[47]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[48]  Ran Raz,et al.  Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs , 1998, Discret. Comput. Geom..