{"id":"https://openalex.org/W7110233088","doi":"https://doi.org/10.4230/lipics.icalp.2025.93","title":"On Incremental Approximate Shortest Paths in Directed Graphs","display_name":"On Incremental Approximate Shortest Paths in Directed Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110233088","doi":"https://doi.org/10.4230/lipics.icalp.2025.93"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23470","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.93","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.93/LIPIcs.ICALP.2025.93.pdf","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":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.93/LIPIcs.ICALP.2025.93.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"G\u00f3rkiewicz, Adam","orcid":null},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"G\u00f3rkiewicz, Adam","raw_affiliation_strings":["University of Wroc\u0142aw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":null,"display_name":"Karczmarz, Adam","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Karczmarz, Adam","raw_affiliation_strings":["University of Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.61953486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7462000250816345,"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.7462000250816345,"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/T10237","display_name":"Cryptography and Data Security","score":0.05609999969601631,"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/T11478","display_name":"Caching and Content Delivery","score":0.019300000742077827,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5949000120162964},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5931000113487244},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5843999981880188},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4271000027656555},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.4097000062465668},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3919000029563904},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.383899986743927}],"concepts":[{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5949000120162964},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5931000113487244},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5843999981880188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5012000203132629},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4722000062465668},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41909998655319214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41339999437332153},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40619999170303345},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3919000029563904},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.383899986743927},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.357699990272522},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.35010001063346863},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3001999855041504},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2612000107765198}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23470","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.93","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.93/LIPIcs.ICALP.2025.93.pdf","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":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23470","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.93","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.93/LIPIcs.ICALP.2025.93.pdf","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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335039","display_name":"Narodowe Centrum Bada\u0144 i Rozwoju","ror":"https://ror.org/05pwfyy15"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110233088.pdf","grobid_xml":"https://content.openalex.org/works/W7110233088.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,98],"show":[4,99],"new":[5],"data":[6,32,105,138,146,183],"structures":[7,33,147],"maintaining":[8],"approximate":[9],"shortest":[10,181],"paths":[11,182],"in":[12],"sparse":[13,58,186],"directed":[14],"graphs":[15],"with":[16,43,52],"polynomially":[17,63],"bounded":[18],"non-negative":[19],"edge":[20,23,113],"weights":[21],"under":[22],"insertions.":[24],"We":[25,126],"give":[26],"more":[27],"efficient":[28],"incremental":[29,103,135],"(1+\u03b5)-approximate":[30,102,136],"APSP":[31],"that":[34,120],"work":[35],"against":[36,68],"an":[37,69],"adaptive":[38,70],"adversary:":[39],"a":[40,49,100,108,129],"deterministic":[41,178],"one":[42,51],"O\u0303(m^{3/2}n^{3/4})":[44],"total":[45,54],"update":[46,55],"time":[47],"and":[48,73,86,90,93,132,177],"randomized":[50],"O\u0303(m^{4/3}n^{5/6})":[53],"time.":[56],"For":[57],"graphs,":[59],"these":[60],"both":[61],"improve":[62],"upon":[64],"the":[65,82,118],"best-known":[66],"bound":[67],"adversary":[71],"[Karczmarz":[72],"\u0141\u0105cki,":[74],"ESA":[75],"2019].":[76],"To":[77],"achieve":[78],"that,":[79],"building":[80],"on":[81],"ideas":[83],"of":[84,123,163],"[Chechik":[85],"Zhang,":[87],"SODA":[88,96],"2021]":[89],"[Kyng,":[91],"Meierhans":[92],"Probst":[94],"Gutenberg,":[95],"2022],":[97],"near-optimal":[101,133,176],"SSSP":[104,137,145],"structure":[106,184],"for":[107,154,185],"special":[109],"case":[110],"when":[111],"all":[112],"updates":[114],"are":[115],"adjacent":[116],"to":[117,166,175],"source,":[119],"might":[121],"be":[122],"independent":[124],"interest.":[125],"also":[127],"describe":[128],"very":[130],"simple":[131],"offline":[134,172],"structure.":[139],"While":[140],"online":[141],"near-linear":[142],"partially":[143],"dynamic":[144],"have":[148],"been":[149],"elusive":[150],"so":[151],"far":[152],"(except":[153],"dense":[155],"instances),":[156],"our":[157,171],"result":[158],"excludes":[159],"using":[160],"certain":[161],"types":[162],"impossibility":[164],"arguments":[165],"rule":[167],"them":[168],"out.":[169],"Additionally,":[170],"solution":[173],"leads":[174],"all-pairs":[179],"bounded-leg":[180],"graphs.":[187]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-08T00:00:00"}