Ramsey Spanning Trees and Their Applications

  title={Ramsey Spanning Trees and Their Applications},
  author={Ittai Abraham and Shiri Chechik and Michael Elkin and Arnold Filtser and Ofer Neiman},
  journal={ACM Transactions on Algorithms (TALG)},
  pages={1 - 21}
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 [29] 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 article, we study the natural… 

Figures and Tables from this paper

Advances in Metric Ramsey Theory and its Applications

  • Y. Bartal
  • Mathematics, Computer Science
  • 2021
This decomposition provides the first deterministic Bourgain-type embedding of finite metric spaces into Euclidean space, and an optimal multi-embedding into ultrametrics, thus improving its applications in approximation and online algorithms.

Clan embeddings into trees, and low treewidth graphs

This paper designs Ramsey-type embedding and clan embedding analogs of the stochastic embedding for minor-free graphs of diameter prameterized by D, which were known to be stochastically embeddable into bounded treewidth graphs with expected additive distortion є D.

Covering Metric Spaces by Few Trees

Efficient algorithms to construct tree covers and Ramsey tree covers for general, planar and doubling metrics are devised and a large separation is shown between what can be achieved by tree covers vs. Ramsey tree cover.

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries

A new tree embedding is provided which addresses issues by deterministically embedding a graph into a single tree containing O(logn) copies of each vertex while preserving the connectivity structure of every subgraph and O(log n)-approximating the cost ofevery subgraph.

Low Treewidth Embeddings of Planar and Minor-Free Metrics

  • Bar-Ilan
  • Computer Science, Mathematics
  • 2022
A new embedding technique to improve the treewidth bound of Cohen-Addad et al. is devised and a deterministic embedding of planar graphs of diameter D into graphs oftreewidth O ((log log n ) 2 ) and additive distortion + (cid:15)D that can be constructed in nearly linear time is obtained.

Low Treewidth Embeddings of Planar and Minor-Free Metrics

A new embedding technique to improve the treewidth bound of Cohen-Addad et al. is devised and a deterministic embedding of planar graphs of diameter D into graphs oftreewidth O and additive distortion + (cid:15)D that can be constructed in nearly linear time is obtained.

Hop-Constrained Metric Embeddings and their Applications

  • Arnold Filtser
  • Computer Science
    2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
This paper improves the Ramsey-type embedding to obtain parameters $t=\beta=\frac{\tilde{O}(\log n)}{\epsilon}$, and generalize it to arbitrary distortion parameter $t$ (in the cost of reducing the size of $M$).

Reliable Spanners: Locality-Sensitive Orderings Strike Back

This work constructs a locality-sensitive ordering for doubling metrics with a small number of orderings suitable for non-Euclidean metrics and constructs reliable spanners from the newly introduced locality- sensitive orderings via reliable 2-hop spanners for paths.

Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners

Euclidean spanners can be viewed as means of compressing the pairwise distances of a d-dimensional Euclidean space into O(n) = O∈,d (n) spanner edges, so that the spanner distances preserve the original distances to within a factor of 1 + ε.

Tree embeddings for hop-constrained network design

It is shown that hop-constrained distances can be approximated by distributions over ``partial tree metrics'' and built into a powerful and versatile algorithmic tool which, similarly to classic probabilistic tree embeddings, reduces hop- Constrained problems in general graphs to hop-unconstraining problems on trees.



Ramsey partitions and proximity data structures

  • M. MendelA. Naor
  • Computer Science, Mathematics
    2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006
This paper introduces and construct optimal Ramsey partitions, and uses them to show that for every epsiv isin (0,1), any n-point metric space has a subset of size n1-epsiv which embeds into Hilbert space with distortion O(1/epsiv), and improves part of the metric Ramsey theorem of Bartal et al. (2005).

On metric ramsey-type phenomena

This paper states that for any ε>0, every n point metric space contains a subspace of size at least n1-ε which is embeddable in an ultrametric with O(log(1/ε)/ε distortion, which provides a bound for embedding in Euclidean spaces.

Approximation algorithms for the 0-extension problem

It is proved that the integrality ratio of the metric relaxation is at least c√lgk for a positive c for infinitely many k and the results improve some of the results of Kleinberg and Tardos and they further the understanding on how to use metric relaxations.

A tight bound on approximating arbitrary metrics by tree metrics

In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon the

The 4/3 additive spanner exponent is tight

A new information theoretic incompressibility bound is shown: there is no function that compresses graphs into O(n4/3 − ε) bits so that distance information can be recovered within +no(1) error.

Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is D-equivalent to an ultrametric, where D ∈

Ramsey-type theorems for metric spaces with applications to online problems

Fast Algorithms for Finding Nearest Common Ancestors

An algorithm for a random access machine with uniform cost measure (and a bound of $\Omega (\log n)$ on the number of bits per word) that requires time per query and preprocessing time is presented, assuming that the collection of trees is static.

A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs

This paper presents an extremely simple linear time randomized algorithm that constructs (2k - 1)-spanner of size matching the conjectured lower bound, and thus can be adapted suitably to obtain efficient distributed and parallel algorithms.

Deterministic Constructions of Approximate Distance Oracles and Spanners

The first deterministic linear time algorithm for constructing optimal spanners of weighted graphs is obtained by derandomizing the O(km) expected time algorithm of Baswana and Sen for constructing (2k–1)-spanners of size O(kn) of weighted undirected graphs without incurring any asymptotic loss in the running time or in the size of the spanners produced.