A Unified and Fine-Grained Approach for Light Spanners

08/24/2020
by   Hung Le, et al.
0

Seminal works on light spanners from recent years provide near-optimal tradeoffs between the stretch and lightness of spanners in general graphs, minor-free graphs, and doubling metrics. In FOCS'19 the authors provided a “truly optimal” tradeoff for Euclidean low-dimensional spaces. Some of these papers employ inherently different techniques than others. Moreover, the runtime of these constructions is rather high. In this work, we present a unified and fine-grained approach for light spanners. Besides the obvious theoretical importance of unification, we demonstrate the power of our approach in obtaining (1) stronger lightness bounds, and (2) faster construction times. Our results include: _ K_r-minor-free graphs: A truly optimal spanner construction and a fast construction. _ General graphs: A truly optimal spanner – almost and a linear-time construction with near-optimal lightness. _ Low dimensional Euclidean spaces: We demonstrate that Steiner points help in reducing the lightness of Euclidean 1+ϵ-spanners almost quadratically for d≥ 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2021

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions

Seminal works on light spanners over the years provide spanners with opt...
research
04/20/2018

Light Spanners for High Dimensional Norms via Stochastic Decompositions

Spanners for low dimensional spaces (e.g. Euclidean space of constant di...
research
11/26/2021

A Unified Framework of Light Spanners II: Fine-Grained Optimality

Seminal works on light spanners over the years provide spanners with opt...
research
04/07/2019

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces

We give an algorithm that computes a (1+ϵ)-approximate Steiner forest in...
research
07/30/2021

Near-Optimal Spanners for General Graphs in (Nearly) Linear Time

Let G = (V,E,w) be a weighted undirected graph on |V| = n vertices and |...
research
07/17/2020

Reliable Spanners for Metric Spaces

A spanner is reliable if it can withstand large, catastrophic failures i...
research
03/02/2023

Coresets for Clustering in Geometric Intersection Graphs

Designing coresets–small-space sketches of the data preserving cost of t...

Please sign up or login with your details

Forgot password? Click here to reset