de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons118120

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44737

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons199379

Krinninger,  Sebastian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons123371

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

Fulltext (public)
There are no public fulltexts available
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.), 31 International Symposium on Distributed Computing (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.DISC.2017.7.


Cite as: http://hdl.handle.net/21.11116/0000-0000-3F19-F
Abstract
There is no abstract available