Greedy spanners are optimal in doubling metrics

12/13/2017
by   Glencora Borradaile, et al.
0

We show that the greedy spanner algorithm constructs a (1+ϵ)-spanner of weight ϵ^-O(d)w(MST) for a point set in metrics of doubling dimension d, resolving an open problem posed by Gottlieb. Our result generalizes the result by Narasimhan and Smid who showed that a point set in d-dimension Euclidean space has a (1+ϵ)-spanner of weight at most ϵ^-O(d)w(MST). Our proof only uses the packing property of doubling metrics and thus implies a much simpler proof for the same result in Euclidean space.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2021

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators

The greedy spanner in a low dimensional Euclidean space is a fundamental...
research
05/04/2023

Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing

Boob et al. [1] described an iterative peeling algorithm called Greedy++...
research
06/29/2022

Minimum Weight Euclidean (1+ε)-Spanners

Given a set S of n points in the plane and a parameter ε>0, a Euclidean ...
research
11/08/2018

Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering

Consider an instance of Euclidean k-means or k-medians clustering. We sh...
research
04/26/2019

Truly Optimal Euclidean Spanners

Euclidean spanners are important geometric structures, having found nume...
research
09/16/2019

Metrics and barycenters for point pattern data

We introduce the transport-transform (TT) and the relative transport-tra...
research
09/22/2021

The Point-to-Set Principle, the Continuum Hypothesis, and the Dimensions of Hamel Bases

We prove that the Continuum Hypothesis implies that every real number in...

Please sign up or login with your details

Forgot password? Click here to reset