Ramsey spanning trees and their applications

DOI10.1145/3371039zbMATH Open1403.05028arXiv1707.08769OpenAlexW3011280253MaRDI QIDQ4607997FDOQ4607997

Authors: Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman 

Publication date: 15 March 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Abstract: The metric Ramsey problem asks for the largest subset $S$ of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem. Mendel and Naor 2007 devised the so called Ramsey Partitions to address this problem, and showed the algorithmic applications of their techniques to approximate distance oracles and ranking problems. In this paper we study the natural extension of the metric Ramsey problem to graphs, and introduce the notion of Ramsey Spanning Trees. We ask for the largest subset $SsubseteqV$ of a given graph $G=(V,E)$, such that there exists a spanning tree of $G$ that has small stretch for $S$. Applied iteratively, this provides a small collection of spanning trees, such that each vertex has a tree providing low stretch paths to all other vertices. The union of these trees serves as a special type of spanner, a tree-padding spanner. We use this spanner to devise the first compact stateless routing scheme with $O(1)$ routing decision time, and labels which are much shorter than in all currently existing schemes. We first revisit the metric Ramsey problem, and provide a new deterministic construction. We prove that for every $k$, any $n$-point metric space has a subset $S$ of size at least $n^{1-1/k}$ which embeds into an ultrametric with distortion $8k$. This results improves the best previous result of Mendel and Naor that obtained distortion $128k$ and required randomization. In addition, it provides the state-of-the-art deterministic construction of a distance oracle. Building on this result, we prove that for every $k$, any $n$-vertex graph $G=(V,E)$ has a subset $S$ of size at least $n^{1-1/k}$, and a spanning tree of $G$, that has stretch $O(kloglogn)$ between any point in $S$ and any point in $V$.

Full work available at URL: https://arxiv.org/abs/1707.08769

Recommendations

• Ramsey spanning trees and their applications
• Ramsey partitions and proximity data structures
• Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
• Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
• Resilient and low stretch routing through embedding into tree metrics

zbMATH Keywords

spanning treesdistortiondistance oraclesmetric embeddingcompact routingmetric Ramsey problemtree-padding spanner

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Generalized Ramsey theory (05C55) Metric embeddings as related to computational problems and algorithms (68R12)

Cited In (9)

• Graph spanners: a tutorial review
• Covering Metric Spaces by Few Trees
• Resilient and low stretch routing through embedding into tree metrics
• Title not available (Why is that?)
• Using petal-decompositions to build a low stretch spanning tree
• Ramsey spanning trees and their applications
• Ramsey partitions and proximity data structures
• Covering metric spaces by few trees
• Light spanners for high dimensional norms via stochastic decompositions

This page was built for publication: Ramsey spanning trees and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607997)