Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and 
Streaming Models

Becker, Ruben; Forster, Sebastian; Karrenbauer, Andreas; Lenzen, Christoph

doi:10.1137/19M1286955

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

MPS-Authors

/persons/resource/persons44737

Karrenbauer, Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons123371

Lenzen, Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Becker, R., Forster, S., Karrenbauer, A., & Lenzen, C. (2021). Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM Journal on Computing, 50(3), 815-856. doi:10.1137/19M1286955.

Cite as: https://hdl.handle.net/21.11116/0000-0008-E543-A

Abstract

There is no abstract available