{"id":"https://openalex.org/W4414683390","doi":"https://doi.org/10.1145/3798129.3800733","title":"Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method","display_name":"Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4414683390","doi":"https://doi.org/10.1145/3798129.3800733"},"language":"en","primary_location":{"id":"doi:10.1145/3798129.3800733","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798129.3800733","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2506.19207","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063729451","display_name":"Yang P. Liu","orcid":"https://orcid.org/0000-0001-6717-0539"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yang P. Liu","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0001-6717-0539","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063729451"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03685742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9714999794960022,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9714999794960022,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5956000089645386},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4918000102043152},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4636000096797943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4629000127315521},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.454800009727478},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4189000129699707},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.3986000120639801},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.38679999113082886}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7032999992370605},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5956000089645386},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5544999837875366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5214999914169312},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4918000102043152},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.454800009727478},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.3986000120639801},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.3750999867916107},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36489999294281006},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.36239999532699585},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28940001130104065},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.2734000086784363},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.27129998803138733},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.25119999051094055},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.2506999969482422}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800733","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798129.3800733","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2506.19207","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.19207","pdf_url":"https://arxiv.org/pdf/2506.19207","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2506.19207","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2506.19207","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2506.19207","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.19207","pdf_url":"https://arxiv.org/pdf/2506.19207","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"algorithm":[3,35],"that":[4],"takes":[5],"a":[6,26,55,74],"directed":[7],"graph":[8],"$G$":[9],"undergoing":[10],"$m$":[11],"edge":[12],"insertions":[13],"with":[14],"lengths":[15],"in":[16,40],"$[1,":[17],"W]$,":[18],"and":[19,38,77],"maintains":[20],"$(1+\u03b5)$-approximate":[21],"shortest":[22],"path":[23],"distances":[24,65],"from":[25,66],"fixed":[27],"source":[28],"$s$":[29,67],"to":[30,60],"all":[31],"other":[32,68],"vertices.":[33],"The":[34],"is":[36,51],"deterministic":[37,82],"runs":[39],"total":[41],"time":[42],"$m^{1+o(1)}\\log":[43],"W$,":[44],"for":[45],"any":[46],"$\u03b5>":[47],"\\exp(-(\\log":[48],"m)^{0.99})$.":[49],"This":[50],"achieved":[52],"by":[53,73],"designing":[54],"nonstandard":[56],"interior":[57],"point":[58],"method":[59],"crudely":[61],"detect":[62],"when":[63],"the":[64,81],"vertices":[69],"$v$":[70],"have":[71],"decreased":[72],"$(1+\u03b5)$":[75],"factor,":[76],"implementing":[78],"it":[79],"using":[80],"min-ratio":[83],"cycle":[84],"data":[85],"structure":[86],"of":[87],"[Chen-Kyng-Liu-Meierhans-Probst,":[88],"STOC":[89],"2024].":[90]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}