@article{DBLP:journals/siamcomp/BeckerFKL21,
	author = {Ruben Becker and Sebastian Forster and Andreas Karrenbauer and Christoph Lenzen},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/siamcomp/BeckerFKL21.bib},
	date-added = {2021-07-16 17:04:43 +0200},
	date-modified = {2021-07-16 17:04:43 +0200},
	doi = {10.1137/19M1286955},
	journal = {{SIAM} J. Comput.},
	number = {3},
	pages = {815--856},
	timestamp = {Wed, 14 Jul 2021 15:55:50 +0200},
	title = {Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models},
	url = {https://doi.org/10.1137/19M1286955},
	volume = {50},
	year = {2021},
	Bdsk-Url-1 = {https://doi.org/10.1137/19M1286955}}

{"_id":"W2LdMnmoP9sY4ERmJ","bibbaseid":"becker-forster-karrenbauer-lenzen-nearoptimalapproximateshortestpathsandtransshipmentindistributedandstreamingmodels-2021","authorIDs":[],"author_short":["Becker, R.","Forster, S.","Karrenbauer, A.","Lenzen, C."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Ruben"],"propositions":[],"lastnames":["Becker"],"suffixes":[]},{"firstnames":["Sebastian"],"propositions":[],"lastnames":["Forster"],"suffixes":[]},{"firstnames":["Andreas"],"propositions":[],"lastnames":["Karrenbauer"],"suffixes":[]},{"firstnames":["Christoph"],"propositions":[],"lastnames":["Lenzen"],"suffixes":[]}],"bibsource":"dblp computer science bibliography, https://dblp.org","biburl":"https://dblp.org/rec/journals/siamcomp/BeckerFKL21.bib","date-added":"2021-07-16 17:04:43 +0200","date-modified":"2021-07-16 17:04:43 +0200","doi":"10.1137/19M1286955","journal":"SIAM J. Comput.","number":"3","pages":"815–856","timestamp":"Wed, 14 Jul 2021 15:55:50 +0200","title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models","url":"https://doi.org/10.1137/19M1286955","volume":"50","year":"2021","bdsk-url-1":"https://doi.org/10.1137/19M1286955","bibtex":"@article{DBLP:journals/siamcomp/BeckerFKL21,\n\tauthor = {Ruben Becker and Sebastian Forster and Andreas Karrenbauer and Christoph Lenzen},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/siamcomp/BeckerFKL21.bib},\n\tdate-added = {2021-07-16 17:04:43 +0200},\n\tdate-modified = {2021-07-16 17:04:43 +0200},\n\tdoi = {10.1137/19M1286955},\n\tjournal = {{SIAM} J. Comput.},\n\tnumber = {3},\n\tpages = {815--856},\n\ttimestamp = {Wed, 14 Jul 2021 15:55:50 +0200},\n\ttitle = {Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models},\n\turl = {https://doi.org/10.1137/19M1286955},\n\tvolume = {50},\n\tyear = {2021},\n\tBdsk-Url-1 = {https://doi.org/10.1137/19M1286955}}\n\n","author_short":["Becker, R.","Forster, S.","Karrenbauer, A.","Lenzen, C."],"key":"DBLP:journals/siamcomp/BeckerFKL21","id":"DBLP:journals/siamcomp/BeckerFKL21","bibbaseid":"becker-forster-karrenbauer-lenzen-nearoptimalapproximateshortestpathsandtransshipmentindistributedandstreamingmodels-2021","role":"author","urls":{"Paper":"https://doi.org/10.1137/19M1286955"},"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"article","biburl":"https://drive.google.com/uc?export=download&id=19WpQhoMIwJIL1DMqKywl2YoH2M7MIki5","creationDate":"2021-01-06T13:12:52.336Z","downloads":0,"keywords":[],"search_terms":["near","optimal","approximate","shortest","paths","transshipment","distributed","streaming","models","becker","forster","karrenbauer","lenzen"],"title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models","year":2021,"dataSources":["RKZzE9qbnqyegdbZi","SLiNCsdz7vcMjc4QP","kCt8NvHdC72dHkmfu"]}