Distributed Spanner Approximation

DOI10.1145/3212734.3212758zbMath1428.68368arXiv1802.03160OpenAlexW2963738383WikidataQ130857352 ScholiaQ130857352MaRDI QIDQ5197675

Michal Dory, Keren Censor-Hillel

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03160

zbMATH Keywords

approximation algorithmsspannershardness of approximationdistributed network design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (2)

The sparsest additive spanner via multiple weighted BFS trees ⋮ The Sparsest Additive Spanner via Multiple Weighted BFS Trees

This page was built for publication: Distributed Spanner Approximation