A Polynomial Time Algorithm for Almost Optimal Vertex Fault Tolerant Spanners

02/26/2020
by   Udit Agarwal, et al.
0

We present the first polynomial time algorithm for the f vertex fault tolerant spanner problem, which achieves almost optimal spanner size. Our algorithm for constructing f vertex fault tolerant spanner takes O(k· n· m^2 · W) time, where W is the maximum edge weight, and constructs a spanner of size O(n^1+1/kf^1-1/k· (log n)^1-1/k). Our spanner has almost optimal size and is at most a log n factor away from the upper bound on the worst-case size. Prior to this work, no other polynomial time algorithm was known for constructing f vertex fault tolerant spanner with optimal size. Our algorithm is based on first greedily constructing a hitting set for the collection of paths of weight at most k · w(u,v) between the endpoints u and v of an edge (u,v) and then using this set to decide whether the edge (u,v) needs to be added to the growing spanner.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2020

Optimal Vertex Fault-Tolerant Spanners in Polynomial Time

Recent work has pinned down the existentially optimal size bounds for ve...
research
02/25/2020

Efficient and Simple Algorithms for Fault Tolerant Spanners

It was recently shown that a version of the greedy algorithm gives a con...
research
12/14/2018

A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners

We give a short and easy upper bound on the worst-case size of fault tol...
research
03/10/2021

Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains

Given a set S of n points, a weight function w to associate a non-negati...
research
06/20/2023

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier

An essential requirement of spanners in many applications is to be fault...
research
12/12/2019

Short simplex paths in lattice polytopes

We consider the problem of optimizing a linear function over a lattice p...
research
02/22/2021

Partially Optimal Edge Fault-Tolerant Spanners

Recent work has established that, for every positive integer k, every n-...

Please sign up or login with your details

Forgot password? Click here to reset