{"id":"https://openalex.org/W7135224405","doi":"https://doi.org/10.48550/arxiv.2603.11729","title":"Adapting Dijkstra for Buffers and Unlimited Transfers","display_name":"Adapting Dijkstra for Buffers and Unlimited Transfers","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7135224405","doi":"https://doi.org/10.48550/arxiv.2603.11729"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11729","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11729","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.11729","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126722103","display_name":"Denys Katkalo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Katkalo, Denys","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114617330","display_name":"Andrii Rohovyi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rohovyi, Andrii","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081161029","display_name":"Toby Walsh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Walsh, Toby","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T11106","display_name":"Data Management and Algorithms","score":0.3982999920845032,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.3982999920845032,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.2110999971628189,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.06629999727010727,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8007000088691711},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6115999817848206},{"id":"https://openalex.org/keywords/transfer","display_name":"Transfer (computing)","score":0.44350001215934753},{"id":"https://openalex.org/keywords/public-transport","display_name":"Public transport","score":0.42260000109672546},{"id":"https://openalex.org/keywords/buffer","display_name":"Buffer (optical fiber)","score":0.4205000102519989},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.40630000829696655}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8007000088691711},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7437999844551086},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6115999817848206},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.44350001215934753},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.42260000109672546},{"id":"https://openalex.org/C145018004","wikidata":"https://www.wikidata.org/wiki/Q4985944","display_name":"Buffer (optical fiber)","level":2,"score":0.4205000102519989},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4138000011444092},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.40630000829696655},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38960000872612},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3732999861240387},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.3601999878883362},{"id":"https://openalex.org/C40842320","wikidata":"https://www.wikidata.org/wiki/Q19423","display_name":"Buffer overflow","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3239000141620636},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29670000076293945},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.26019999384880066}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11729","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11729","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.11729","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11729","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,41],"recent":[1],"years,":[2],"RAPTOR":[3],"based":[4],"algorithms":[5,36],"have":[6,94],"been":[7],"considered":[8],"the":[9,24,115,151],"state-of-the-art":[10],"for":[11,49],"path-finding":[12],"with":[13,53,175],"unlimited":[14,54],"transfers":[15,55],"without":[16,37,107,177],"preprocessing.":[17],"However,":[18,64],"this":[19,42,88,119],"status":[20],"largely":[21],"stems":[22],"from":[23],"evolution":[25],"of":[26],"routing":[27,52],"research,":[28],"where":[29],"Dijkstra-based":[30,47],"solutions":[31],"were":[32],"superseded":[33],"by":[34],"timetable-based":[35],"a":[38,82,127,163],"systematic":[39],"comparison.":[40],"work,":[43],"we":[44,121,158],"revisit":[45],"classical":[46],"approaches":[48],"public":[50],"transit":[51],"and":[56,109,153,176],"demonstrate":[57],"that":[58,87,129,157],"Time-Dependent":[59],"Dijkstra":[60,125],"(TD-Dijkstra)":[61],"outperforms":[62],"MR.":[63,147],"efficient":[65],"TD-Dijkstra":[66],"implementations":[67],"rely":[68],"on":[69,150,172],"filtering":[70,89],"dominated":[71],"connections":[72],"during":[73],"preprocessing,":[74],"which":[75],"assumes":[76],"passengers":[77,103,111],"can":[78,159],"always":[79],"switch":[80],"to":[81],"faster":[83],"connection.":[84],"We":[85],"show":[86,156],"is":[90],"unsound":[91],"when":[92],"stops":[93],"buffer":[95,140,178],"times,":[96],"as":[97],"it":[98],"cannot":[99],"distinguish":[100],"between":[101],"seated":[102],"who":[104,112],"may":[105],"continue":[106],"waiting":[108],"transferring":[110],"must":[113],"respect":[114],"buffer.":[116],"To":[117],"address":[118],"limitation,":[120],"introduce":[122],"Transfer":[123],"Aware":[124],"(TAD),":[126],"modification":[128],"scans":[130],"entire":[131],"trip":[132],"sequences":[133],"rather":[134],"than":[135,162],"individual":[136],"edges,":[137],"correctly":[138],"handling":[139],"times":[141],"while":[142,168],"maintaining":[143],"performance":[144],"advantages":[145],"over":[146,166],"Our":[148],"experiments":[149],"London":[152],"Switzerland":[154],"networks":[155],"achieve":[160],"more":[161],"twofold":[164],"speedup":[165],"MR":[167],"producing":[169],"optimal":[170],"results":[171],"both":[173],"networks,":[174],"times.":[179]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-14T00:00:00"}