![]() | Up a level |
Elkin, Michael and Trehan, Chhaya ORCID: 0000-0002-3249-3212
(2022)
(1 + ϵ)-Approximate shortest paths in dynamic streams.
In: Chakrabarti, Amit and Swamy, Chaitanya, (eds.)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022).
Leibniz International Proceedings in Informatics, LIPIcs,51.
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Germany, 51:1 – 51:23.
ISBN 9783959772495
Elkin, Michael and Trehan, Chhaya ORCID: 0000-0002-3249-3212
(2022)
Brief announcement: (1+)-approximate shortest paths in dynamic streams.
In:
PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing.
Association for Computing Machinery, pp. 57-59.
ISBN 9781450392624