Covering Metric Spaces by Few Trees

05/18/2019
by   Yair Bartal, et al.
0

A tree cover of a metric space (X,d) is a collection of trees, so that every pair x,y∈ X has a low distortion path in one of the trees. If it has the stronger property that every point x∈ X has a single tree with low distortion paths to all other points, we call this a Ramsey tree cover. Tree covers and Ramsey tree covers have been studied by BLMN03,GKR04,CGMZ05,GHR06,MN07, and have found several important algorithmic applications, e.g. routing and distance oracles. The union of trees in a tree cover also serves as a special type of spanner, that can be decomposed into a few trees with low distortion paths contained in a single tree; Such spanners for Euclidean pointsets were presented by ADMSS95. In this paper we devise efficient algorithms to construct tree covers and Ramsey tree covers for general, planar and doubling metrics. We pay particular attention to the desirable case of distortion close to 1, and study what can be achieved when the number of trees is small. In particular, our work shows a large separation between what can be achieved by tree covers vs. Ramsey tree covers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2023

Covering Planar Metrics (and Beyond): O(1) Trees Suffice

While research on the geometry of planar graphs has been active in the p...
research
09/17/2020

Bounds on Sweep-Covers by Functional Compositions of Ordered Integer Partitions and Raney Numbers

A sweep-cover is a vertex separator in trees that covers all the nodes b...
research
01/04/2021

Clan Embeddings into Trees, and Low Treewidth Graphs

In low distortion metric embeddings, the goal is to embed a host "hard" ...
research
12/19/2018

On the entropy of coverable subshifts

A coloration w of Z^2 is said to be coverable if there exists a rectangu...
research
06/21/2018

A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization

Data compression plays a crucial part in the cloud based systems of toda...
research
06/21/2015

Beyond Hartigan Consistency: Merge Distortion Metric for Hierarchical Clustering

Hierarchical clustering is a popular method for analyzing data which ass...
research
07/18/2020

Combinatorial and computational investigations of Neighbor-Joining bias

The Neighbor-Joining algorithm is a popular distance-based phylogenetic ...

Please sign up or login with your details

Forgot password? Click here to reset