Efficient and Simple Algorithms for Fault-Tolerant Spanners

Caleb Robelle
Caleb Robelle

PODC '20: ACM Symposium on Principles of Distributed Computing Virtual Event Italy August, 2020, pp. 493-500, 2020.

Cited by: 0|Bibtex|Views1|Links
EI

Abstract:

It was recently shown that a version of the greedy algorithm gives a construction of fault-tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to construct this spanner is not polynomial-time, and the best-known polynomial time algorithm is significantly suboptimal. Designing a polynomial-time algori...More

Code:

Data:

Your rating :
0

 

Tags
Comments