π
π
The Cartographer
A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
December 14, 2018 Β· Declared Dead Β· π ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Greg Bodwin, Shyamal Patel
arXiv ID
1812.05778
Category
cs.DS: Data Structures & Algorithms
Cross-listed
math.CO
Citations
28
Venue
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
Last Checked
3 months ago
Abstract
We give a short and easy upper bound on the worst-case size of fault tolerant spanners, which improves on all prior work and is fully optimal at least in the setting of vertex faults.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted