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

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

doi:10.4230/LIPIcs.DISC.2017.7

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

MPS-Authors

/persons/resource/persons118120

Becker, Ruben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44737

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

/persons/resource/persons199379

Krinninger, Sebastian
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

http://drops.dagstuhl.de/opus/volltexte/2017/8003/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

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., Karrenbauer, A., Krinninger, S., & Lenzen, C. (2017). Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. In A. W. Richa (Ed.), 31st International Symposium on Distributed Computing (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.DISC.2017.7.

Cite as: https://hdl.handle.net/21.11116/0000-0000-3F19-F

Abstract

There is no abstract available