{"id":"https://openalex.org/W2949524113","doi":"https://doi.org/10.1137/19m1286955","title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models","display_name":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W2949524113","doi":"https://doi.org/10.1137/19m1286955","mag":"2949524113"},"language":"en","primary_location":{"id":"doi:10.1137/19m1286955","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1286955","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017265124","display_name":"Ruben Becker","orcid":"https://orcid.org/0000-0002-3495-3753"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ruben Becker","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sebastian Forster","orcid":"https://orcid.org/0000-0002-2191-3381"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Forster","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015328592","display_name":"Andreas Karrenbauer","orcid":"https://orcid.org/0000-0001-6129-3220"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Karrenbauer","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017265124"],"corresponding_institution_ids":["https://openalex.org/I149899117"],"apc_list":null,"apc_paid":null,"fwci":1.961,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.87543289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"50","issue":"3","first_page":"815","last_page":"856"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9505000114440918,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9355000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6808489561080933},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5922378301620483},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5366318821907043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5160326957702637},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4618069529533386},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.4561123847961426},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43205568194389343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4065232574939728},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38529494404792786},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33295485377311707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32615697383880615},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.14666873216629028}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6808489561080933},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5922378301620483},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5366318821907043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5160326957702637},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4618069529533386},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.4561123847961426},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43205568194389343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4065232574939728},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38529494404792786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33295485377311707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32615697383880615},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.14666873216629028},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1137/19m1286955","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1286955","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:8003","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.7","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:escidoc.org:escidoc:2351053","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-002B-8419-1","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/workingPaper"},{"id":"pmh:oai:escidoc.org:escidoc:2534318","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0000-3F19-F","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.1607.05127","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1607.05127","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2949524113","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:2534318","pdf_url":null,"source":{"id":"https://openalex.org/S4306420128","display_name":"International Symposium on Distributed Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Symposium on Distributed Computing","raw_type":null},{"id":"mag:3101016316","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8003","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.7","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1966206200","https://openalex.org/W1984090926","https://openalex.org/W1986816824","https://openalex.org/W1987099434","https://openalex.org/W1999545213","https://openalex.org/W2003969379","https://openalex.org/W2014317399","https://openalex.org/W2044246186","https://openalex.org/W2056148792","https://openalex.org/W2056496054","https://openalex.org/W2056518357","https://openalex.org/W2057112598","https://openalex.org/W2083323175","https://openalex.org/W2084224084","https://openalex.org/W2085630237","https://openalex.org/W2148137544","https://openalex.org/W2149342630","https://openalex.org/W2156036190","https://openalex.org/W2164141517","https://openalex.org/W2165753192","https://openalex.org/W2227557434","https://openalex.org/W2310290370","https://openalex.org/W2569942321","https://openalex.org/W2752947237","https://openalex.org/W2900627138","https://openalex.org/W2902989566","https://openalex.org/W2950813619","https://openalex.org/W2963983736","https://openalex.org/W4231761369"],"related_works":["https://openalex.org/W2040011014","https://openalex.org/W2952490263","https://openalex.org/W2963948050","https://openalex.org/W2107282727","https://openalex.org/W2083323175","https://openalex.org/W2048098617","https://openalex.org/W2592613193","https://openalex.org/W2107805020","https://openalex.org/W2040273581","https://openalex.org/W1582638066","https://openalex.org/W3101974321","https://openalex.org/W2963245981","https://openalex.org/W2511108295","https://openalex.org/W1568961751","https://openalex.org/W1534484868","https://openalex.org/W2788015272","https://openalex.org/W2015819397","https://openalex.org/W2139535340","https://openalex.org/W1987099434","https://openalex.org/W147275194"],"abstract_inverted_index":{"We":[0,205],"present":[1],"a":[2,20,35,77,90,95,98,105,127,212],"method":[3,114],"for":[4,119,198,232],"solving":[5],"the":[6,53,72,113,120,136,157,161,207,240,243],"transshipment":[7,73,171,184],"problem":[8,74],"-":[9,17],"also":[10],"known":[11],"as":[12],"uncapacitated":[13],"minimum":[14],"cost":[15],"flow":[16],"up":[18,75],"to":[19,42,76,88,115],"multiplicative":[21,78],"error":[22,79],"of":[23,50,71,80,101,160,242],"$1":[24],"+":[25,144,149,169,182],"\\varepsilon$":[26],"in":[27,46,52,64,230],"undirected":[28],"graphs":[29],"with":[30,216,239],"non-negative":[31,223,234],"edge":[32,224],"weights":[33,225],"using":[34,147,174,187],"tailored":[36],"gradient":[37,56],"descent":[38,57],"algorithm.":[39],"Using":[40,104],"$\\tilde{O}(\\cdot)$":[41],"hide":[43],"polylogarithmic":[44],"factors":[45],"$n$":[47],"(the":[48],"number":[49],"nodes":[51],"graph),":[54],"our":[55,217],"algorithm":[58],"takes":[59],"$\\tilde":[60],"O(\\varepsilon^{-2})$":[61],"iterations,":[62],"and":[63,172,185,190],"each":[65],"iteration":[66,92],"it":[67],"solves":[68],"an":[69],"instance":[70],"$\\operatorname{polylog}":[81],"n$.":[82],"In":[83],"particular,":[84],"this":[85],"allows":[86],"us":[87],"perform":[89],"single":[91],"by":[93,134],"computing":[94,211],"solution":[96],"on":[97],"sparse":[99,202],"spanner":[100,213],"logarithmic":[102],"stretch.":[103],"randomized":[106],"rounding":[107],"scheme,":[108],"we":[109,129],"can":[110],"further":[111],"extend":[112],"finding":[116],"approximate":[117],"solutions":[118],"single-source":[121],"shortest":[122],"paths":[123],"(SSSP)":[124],"problem.":[125],"As":[126],"consequence,":[128],"improve":[130],"upon":[131],"prior":[132],"work":[133],"obtaining":[135],"following":[137],"results:":[138],"(1)":[139],"Broadcast":[140,164],"CONGEST":[141],"model:":[142,167,180],"$(1":[143,168,181],"\\varepsilon)$-approximate":[145,170,183],"SSSP":[146,173,186,196],"$\\tilde{O}((\\sqrt{n}":[148],"D)\\varepsilon^{-3})$":[150],"rounds,":[151],"where":[152],"$":[153,155],"D":[154],"is":[156,214],"(hop)":[158],"diameter":[159],"network.":[162],"(2)":[163],"congested":[165],"clique":[166],"$\\tilde{O}(\\varepsilon^{-2})$":[175,191],"rounds.":[176],"(3)":[177],"Multipass":[178],"streaming":[179],"$\\tilde{O}(n)$":[188],"space":[189],"passes.":[192],"The":[193,219],"previously":[194],"fastest":[195],"algorithms":[197],"these":[199],"models":[200],"leverage":[201],"hop":[203,208],"sets.":[204],"bypass":[206],"set":[209],"construction;":[210],"sufficient":[215],"method.":[218],"above":[220],"bounds":[221],"assume":[222],"that":[226],"are":[227],"polynomially":[228],"bounded":[229],"$n$;":[231],"general":[233],"weights,":[235],"running":[236],"times":[237],"scale":[238],"logarithm":[241],"maximum":[244],"ratio":[245],"between":[246],"non-zero":[247],"weights.":[248]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":6}],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2025-10-10T00:00:00"}