Brief announcement: (1+)-approximate shortest paths in dynamic streams

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

Text (BA-ElkinTrehan) - Accepted Version Download (613kB)

Abstract

Computing approximate shortest paths in the dynamic streaming setting is a fundamental challenge that has been intensively studied. Currently existing solutions for this problem either build a sparse multiplicative spanner of the input graph and compute shortest paths in the spanner offline, or compute an exact single source BFS tree. Solutions of the first type are doomed to incur a stretch-space tradeoff of 2k - 1 versus n1+1/k , for an integer parameter k. (In fact, existing solutions also incur an extra factor of 1+ in the stretch for weighted graphs, and an additional factor of logO(1) n in the space.) The only existing solution of the second type uses n1/2-O(1/k) passes over the stream (for space O(n1+1/k )), and applies only to unweighted graphs.

Item Type:	Book Section
Additional Information:	© 2022 The Author.
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	23 Aug 2022 11:36
Last Modified:	26 Oct 2024 17:48
URI:	http://eprints.lse.ac.uk/id/eprint/116376

Actions (login required)

View Item