Efficient algorithms for constructing (1+, )-spanners in the distributed and streaming models
DOI10.1145/1011767.1011791zbMATH Open1321.68462OpenAlexW2122632420MaRDI QIDQ5501495FDOQ5501495
Authors: Michael Elkin, Jian Zhang 
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011791
Recommendations
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model
- Local Computation of Nearly Additive Spanners
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)
Cited In (9)
- New results for finding common neighborhoods in massive graphs in the data stream model
- Multipath spanners via fault-tolerant spanners
- Fast deterministic distributed algorithms for sparse spanners
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model
- (1 + εΒ) -spanner constructions for general graphs
- Computing almost shortest paths (extended abstract)
- Distributed spanner approximation
- Sublinear fully distributed partition with applications
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
This page was built for publication: Efficient algorithms for constructing \((1+{\epsilon}, {\beta})\)-spanners in the distributed and streaming models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501495)
