Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. Becker, R., Karrenbauer, A., Krinninger, S., & Lenzen, C. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, pages 7:1–7:16, 2017.
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/wdag/BeckerKKL17,
	author = {Ruben Becker and Andreas Karrenbauer and Sebastian Krinninger and Christoph Lenzen},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/conf/wdag/BeckerKKL17.bib},
	booktitle = {31st International Symposium on Distributed Computing, {DISC} 2017, October 16-20, 2017, Vienna, Austria},
	crossref = {DBLP:conf/wdag/2017},
	doi = {10.4230/LIPIcs.DISC.2017.7},
	pages = {7:1--7:16},
	timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
	title = {Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models},
	url = {https://doi.org/10.4230/LIPIcs.DISC.2017.7},
	year = {2017},
	bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.DISC.2017.7}}

Downloads: 0