Document Open Access Logo

Vertex Fault-Tolerant Emulators

Authors Greg Bodwin, Michael Dinitz, Yasamin Nazari

Thumbnail PDF


  • Filesize: 0.73 MB
  • 22 pages

Document Identifiers

Author Details

Greg Bodwin
  • University of Michigan, Ann Arbor, MI, USA
Michael Dinitz
  • Johns Hopkins University, Baltimore, MD, United States
Yasamin Nazari
  • University of Salzburg, Austria

Cite AsGet BibTex

Greg Bodwin, Michael Dinitz, and Yasamin Nazari. Vertex Fault-Tolerant Emulators. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 25:1-25:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)


A k-spanner of a graph G is a sparse subgraph that preserves its shortest path distances up to a multiplicative stretch factor of k, and a k-emulator is similar but not required to be a subgraph of G. A classic theorem by Althöfer et al. [Disc. Comp. Geom. '93] and Thorup and Zwick [JACM '05] shows that, despite the extra flexibility available to emulators, the size/stretch tradeoffs for spanners and emulators are equivalent. Our main result is that this equivalence in tradeoffs no longer holds in the commonly-studied setting of graphs with vertex failures. That is: we introduce a natural definition of vertex fault-tolerant emulators, and then we show a three-way tradeoff between size, stretch, and fault-tolerance for these emulators that polynomially surpasses the tradeoff known to be optimal for spanners. We complement our emulator upper bound with a lower bound construction that is essentially tight (within log n factors of the upper bound) when the stretch is 2k-1 and k is either a fixed odd integer or 2. We also show constructions of fault-tolerant emulators with additive error, demonstrating that these also enjoy significantly improved tradeoffs over those available for fault-tolerant additive spanners.

Subject Classification

ACM Subject Classification
  • Theory of computation → Sparsification and spanners
  • Emulators
  • Fault Tolerance
  • Girth Conjecture


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Amir Abboud and Greg Bodwin. The 4/3 additive spanner exponent is tight. Journal of the ACM (JACM), 64(4):1-20, 2017. Google Scholar
  2. Donald Aingworth, Chandra Chekuri, Piotr Indyk, and Rajeev Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28(4):1167-1181, 1999. Google Scholar
  3. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993. Google Scholar
  4. Yair Amir, Claudiu Danilov, Stuart Goose, David Hedqvist, and Andreas Terzis. An overlay architecture for high-quality voip streams. IEEE Transactions on Multimedia, 8(6):1250-1262, 2006. URL:
  5. David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris. Resilient overlay networks. SIGOPS Oper. Syst. Rev., 35(5):131?145, October 2001. URL:
  6. Amy Babay, Emily Wagner, Michael Dinitz, and Yair Amir. Timely, reliable, and cost-effective internet transport service using dissemination graphs. In IEEE 37th International Conference on Distributed Computing Systems (ICDCS), pages 1-12, 2017. URL:
  7. Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. Additive spanners and (α, β)-spanners. ACM Transactions on Algorithms (TALG), 7(1):1-26, 2010. Google Scholar
  8. Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, and Guido Proietti. Improved purely additive fault-tolerant spanners. In Algorithms-ESA 2015, pages 167-178. Springer, 2015. Google Scholar
  9. Greg Bodwin, Michael Dinitz, and Yasamin Nazari. Vertex fault-tolerant emulators. CoRR, abs/2109.08042, 2021. URL:
  10. Greg Bodwin, Michael Dinitz, Merav Parter, and Virginia Vassilevska Williams. Optimal vertex fault tolerant spanners (for fixed stretch). In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1884-1900. SIAM, 2018. Google Scholar
  11. Greg Bodwin, Michael Dinitz, and Caleb Robelle. Optimal vertex fault-tolerant spanners in polynomial time. In Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021. Google Scholar
  12. Greg Bodwin, Michael Dinitz, and Caleb Robelle. Partially optimal edge fault-tolerant spanners. In Proceedings of the Thirty-Thurd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022. Google Scholar
  13. Greg Bodwin, Fabrizio Grandoni, Merav Parter, and Virginia Vassilevska Williams. Preserving distances in very faulty graphs. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80, page 73. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. Google Scholar
  14. Greg Bodwin and Shyamal Patel. A trivial yet optimal solution to vertex fault tolerant spanners. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC ’19, pages 541-543, New York, NY, USA, 2019. Association for Computing Machinery. URL:
  15. Gilad Braunschvig, Shiri Chechik, David Peleg, and Adam Sealfon. Fault tolerant additive and (μ, α)-spanners. Theoretical Computer Science, 580:94-100, 2015. Google Scholar
  16. Shiri Chechik. New additive spanners. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 498-512. SIAM, 2013. Google Scholar
  17. Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty. Fault tolerant spanners for general graphs. SIAM J. Comput., 39(7):3403-3423, 2010. Google Scholar
  18. Michael Dinitz and Caleb Robelle. Efficient and simple algorithms for fault-tolerant spanners. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, PODC ’20, 2020. Google Scholar
  19. Dorit Dor, Shay Halperin, and Uri Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29(5):1740-1759, 2000. Google Scholar
  20. Paul Erdős. Extremal problems in graph theory. In In Theory of Graphs and its Applications, Proc. Sympos. Smolenice, 1964. Google Scholar
  21. Mathias Bæk Tejs Knudsen. Additive spanners: A simple construction. In Scandinavian Workshop on Algorithm Theory, pages 277-281. Springer, 2014. Google Scholar
  22. Merav Parter. Vertex fault tolerant additive spanners. Distributed Computing, 30(5):357-372, 2017. Google Scholar
  23. David Peleg and Alejandro A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99-116, 1989. Google Scholar
  24. David Peleg and Jeffrey D. Ullman. An optimal synchronizer for the hypercube. SIAM J. Comput., 18(4):740-747, 1989. Google Scholar
  25. S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan. Detour: informed internet routing and transport. IEEE Micro, 19(1):50-59, 1999. URL:
  26. Lakshminarayanan Subramanian, Ion Stoica, Hari Balakrishnan, and Randy H. Katz. Overqos: An overlay based architecture for enhancing internet qos. In Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation - Volume 1, NSDI'04, page 6, USA, 2004. USENIX Association. Google Scholar
  27. Mikkel Thorup and Uri Zwick. Approximate distance oracles. Journal of the ACM (JACM), 52(1):1-24, 2005. Google Scholar
  28. David P Woodruff. Additive spanners in nearly quadratic time. In International Colloquium on Automata, Languages, and Programming, pages 463-474. Springer, 2010. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail