{"id":"https://openalex.org/W4206624671","doi":"https://doi.org/10.1137/1.9781611977073.138","title":"A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs","display_name":"A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4206624671","doi":"https://doi.org/10.1137/1.9781611977073.138"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611977073.138","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977073.138","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://researchprofiles.ku.dk/da/publications/7039e3ce-26e9-419a-a802-82d4d41c6c81","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004420568","display_name":"Debarati Das","orcid":"https://orcid.org/0000-0003-2232-4279"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Debarati Das","raw_affiliation_strings":["K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Algorithms and Complexity, DK"],"affiliations":[{"raw_affiliation_string":"K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Algorithms and Complexity, DK","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015325792","display_name":"Maximilian Probst Gutenberg","orcid":"https://orcid.org/0000-0003-3522-156X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maximilian Probst Gutenberg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Algorithms and Complexity, DK"],"affiliations":[{"raw_affiliation_string":"K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Algorithms and Complexity, DK","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004420568"],"corresponding_institution_ids":["https://openalex.org/I4210099593"],"apc_list":null,"apc_paid":null,"fwci":0.6099,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.84402332,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3482","last_page":"3495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9891999959945679,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6849949955940247},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5474482178688049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5411975979804993},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4602912664413452},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4223720133304596},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.40436846017837524},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32851600646972656},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.31013238430023193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2881620526313782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28291499614715576},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11210915446281433},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.058263182640075684}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6849949955940247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5474482178688049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5411975979804993},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4602912664413452},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4223720133304596},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.40436846017837524},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32851600646972656},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.31013238430023193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2881620526313782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28291499614715576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11210915446281433},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.058263182640075684}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/1.9781611977073.138","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977073.138","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7039e3ce-26e9-419a-a802-82d4d41c6c81","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/7039e3ce-26e9-419a-a802-82d4d41c6c81","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"Das , D , Gutenberg , M P & Wulff-Nilsen , C 2022 , A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs . in ACM-SIAM Symposium on Discrete Algorithms, SODA 2022 . Association for Computing Machinery, Inc. , pp. 3482-3495 , 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022 , Alexander , United States , 09/01/2022 . https://doi.org/10.1137/1.9781611977073.138","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7039e3ce-26e9-419a-a802-82d4d41c6c81","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/7039e3ce-26e9-419a-a802-82d4d41c6c81","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"Das , D , Gutenberg , M P & Wulff-Nilsen , C 2022 , A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs . in ACM-SIAM Symposium on Discrete Algorithms, SODA 2022 . Association for Computing Machinery, Inc. , pp. 3482-3495 , 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022 , Alexander , United States , 09/01/2022 . https://doi.org/10.1137/1.9781611977073.138","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2354846196","https://openalex.org/W2391130892","https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2348761196","https://openalex.org/W2347245430","https://openalex.org/W1617152041","https://openalex.org/W2392078542","https://openalex.org/W1519427079","https://openalex.org/W2597144308"],"abstract_inverted_index":{"In":[0,75],"the":[1,22,80,91,95,107,134,147,153,164],"planar,":[2,10],"dynamic":[3,110,149],"All-Pairs":[4],"Shortest":[5],"Paths":[6],"(APSP)":[7],"problem,":[8,157],"a":[9,15,27],"weighted":[11],"digraph":[12],"G":[13],"undergoes":[14],"sequence":[16,97],"of":[17,167],"edge":[18],"weight":[19],"updates":[20],"and":[21,58,87],"goal":[23],"is":[24,73,98,103],"to":[25,145,152],"maintain":[26],"data":[28],"structure":[29],"on":[30],"G,":[31],"that":[32,67],"can":[33],"quickly":[34],"answer":[35],"distance":[36,115],"queries":[37],"between":[38],"any":[39],"two":[40],"vertices":[41],"x,y":[42],"\u220a":[43],"V(G).":[44],"The":[45],"currently":[46],"best":[47],"algorithms":[48],"[FOCS'01,":[49],"SODA'05]":[50],"for":[51,90,112,133,163],"this":[52,76,168],"problem":[53,137,151],"require":[54],"\u00d5(n2/3)":[55],"worst-case":[56,85,139],"update":[57,69,86,96],"query":[59,71,88],"time,":[60],"while":[61],"conditional":[62],"lower":[63],"bounds":[64],"[FOCS'16]":[65],"show":[66],"either":[68],"or":[70],"time":[72,89],"needed1.":[74],"article,":[77],"we":[78,127],"present":[79,129],"first":[81,108],"algorithm":[82,111,132],"with":[83,138],"near-optimal":[84],"offline":[92,109],"setting,":[93],"where":[94],"given":[99],"initially.":[100],"This":[101,142],"result":[102],"obtained":[104],"by":[105],"giving":[106],"maintaining":[113],"dense":[114],"graphs":[116],"(DDGs)":[117],"faster":[118],"than":[119],"recomputing":[120],"from":[121],"scratch":[122],"after":[123],"each":[124],"update.":[125],"Further,":[126],"also":[128],"an":[130],"online":[131,148,154,165],"incremental":[135],"APSP":[136,150,156],"update/query":[140],"time.":[141],"allows":[143],"us":[144],"reduce":[146],"decremental":[155],"which":[158],"constitutes":[159],"partial":[160],"progress":[161],"even":[162],"version":[166],"notorious":[169],"problem.":[170]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}