ACM Transactions on Algorithms (TALG)
Preserving terminal distances using minors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.01 |
We introduce and study the notions of pairwise and sourcewise preservers. Given an undirected N-vertex graph G = (V,E) and a set P of pairs of vertices, let G' = (V,H), H \subseteq E, be called a pairwise preserver of G with respect to P if for every pair {u,w} \in P, distG'(u,w) = distG(u,w). For a set S \subseteq V of sources, a pairwise preserver of G with respect to the set of all pairs P = (S \atop 2) of sources is called a sourcewise preserver of G with respect to S. We prove that for every undirected possibly weighted N-vertex graph G and every set P of P = O(N1/2) pairs of vertices of G, there exists a linear-size pairwise preserver of G with respect to P. Consequently, for every subset S \subseteq V of S = O(N1/4) sources, there exists a linear-size sourcewise preserver of G with respect to S. On the negative side we show that neither of the two exponents (1/2 and 1/4) can be improved even when the attention is restricted to unweighted graphs. Our lower bounds involve constructions of dense convexly independent sets of vectors with small Euclidean norms. We believe that the link between the areas of discrete geometry and spanners that we establish is of independent interest and might be useful in the study of other problems in the area of low-distortion embeddings.