{"id":"https://openalex.org/W2982545951","doi":"https://doi.org/10.3390/a14030090","title":"Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks","display_name":"Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks","publication_year":2021,"publication_date":"2021-03-16","ids":{"openalex":"https://openalex.org/W2982545951","doi":"https://doi.org/10.3390/a14030090","mag":"2982545951"},"language":"en","primary_location":{"id":"doi:10.3390/a14030090","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030090","pdf_url":"https://www.mdpi.com/1999-4893/14/3/90/pdf?version=1616570144","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/3/90/pdf?version=1616570144","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ben Strasser","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ben Strasser","raw_affiliation_strings":["Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Dorothea Wagner","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tim Zeitz","orcid":"https://orcid.org/0000-0003-4746-3582"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tim Zeitz","raw_affiliation_strings":["Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.6926,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.83845638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"90","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9567000269889832,"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.9567000269889832,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.014499999582767487,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.007899999618530273,"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/preprocessor","display_name":"Preprocessor","score":0.54339998960495},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5393000245094299},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5230000019073486},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4819999933242798},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4250999987125397},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.40959998965263367},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3937999904155731},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.383899986743927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7185999751091003},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.54339998960495},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5393000245094299},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5230000019073486},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4819999933242798},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4250999987125397},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.40959998965263367},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.383899986743927},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.34860000014305115},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.32190001010894775},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2964000105857849},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.2881999909877777},{"id":"https://openalex.org/C2988166257","wikidata":"https://www.wikidata.org/wiki/Q924286","display_name":"Traffic network","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25850000977516174},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.25690001249313354},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.25540000200271606},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.2547000050544739},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a14030090","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030090","pdf_url":"https://www.mdpi.com/1999-4893/14/3/90/pdf?version=1616570144","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1910.12726","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.12726","pdf_url":"https://arxiv.org/pdf/1910.12726","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:3632e7bd567f47a6b666ab33bf24b34e","is_oa":true,"landing_page_url":"https://doaj.org/article/3632e7bd567f47a6b666ab33bf24b34e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 3, p 90 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/3/90/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14030090","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms; Volume 14; Issue 3; Pages: 90","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14030090","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030090","pdf_url":"https://www.mdpi.com/1999-4893/14/3/90/pdf?version=1616570144","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2982545951.pdf","grobid_xml":"https://content.openalex.org/works/W2982545951.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1779869868","https://openalex.org/W1904636577","https://openalex.org/W1969483458","https://openalex.org/W2000882268","https://openalex.org/W2009303970","https://openalex.org/W2014889099","https://openalex.org/W2050634818","https://openalex.org/W2091492284","https://openalex.org/W2104317982","https://openalex.org/W2137541800","https://openalex.org/W2140836772","https://openalex.org/W2143083884","https://openalex.org/W2144050074","https://openalex.org/W2169528473","https://openalex.org/W2233419640","https://openalex.org/W2266528661","https://openalex.org/W2284207515","https://openalex.org/W2465485717","https://openalex.org/W2550584736","https://openalex.org/W2609578772","https://openalex.org/W2611711374","https://openalex.org/W2757192859","https://openalex.org/W2955410971","https://openalex.org/W2994987435","https://openalex.org/W3080468723","https://openalex.org/W3110349912","https://openalex.org/W4234928733","https://openalex.org/W6604066609","https://openalex.org/W6629442825","https://openalex.org/W6645943304","https://openalex.org/W6676532417","https://openalex.org/W6913010783"],"related_works":[],"abstract_inverted_index":{"We":[0,141],"study":[1,145],"the":[2,48,52,58,66,69,107,138,163],"problem":[3],"of":[4,68,119,126,149],"quickly":[5],"computing":[6],"point-to-point":[7],"shortest":[8,74],"paths":[9,75,124],"in":[10,72],"massive":[11],"road":[12,49],"networks":[13],"with":[14,157],"traffic":[15,18,28,53],"predictions.":[16],"Incorporating":[17],"predictions":[19],"into":[20],"routing":[21],"allows,":[22],"for":[23],"example,":[24],"to":[25,122,172],"avoid":[26],"commuter":[27],"congestions.":[29],"Existing":[30],"techniques":[31,80],"follow":[32],"a":[33,37,147],"two-phase":[34],"approach:":[35],"In":[36,94],"preprocessing":[38],"step,":[39],"an":[40,143],"index":[41,45,83],"is":[42,121],"built.":[43],"The":[44,63,116],"depends":[46],"on":[47,57,146],"network":[50],"and":[51,61,153,170],"patterns":[54],"but":[55],"not":[56],"path":[59],"start":[60],"end.":[62],"latter":[64],"are":[65,76,134],"input":[67],"query":[70,86,167],"phase,":[71],"which":[73],"computed.":[77],"All":[78],"existing":[79],"have":[81],"large":[82],"size,":[84],"slow":[85],"running":[87,168],"times":[88,128,133,169,174],"or":[89],"may":[90],"compute":[91],"suboptimal":[92],"paths.":[93,140],"this":[95],"work,":[96],"we":[97],"introduce":[98],"CATCHUp":[99,120],"(Customizable":[100],"Approximated":[101],"Time-dependent":[102],"Contraction":[103],"Hierarchies":[104],"through":[105],"Unpacking),":[106],"first":[108],"algorithm":[109],"that":[110],"simultaneously":[111],"achieves":[112,162],"all":[113],"three":[114],"objectives.":[115],"core":[117],"idea":[118],"store":[123],"instead":[125],"travel":[127,132],"at":[129],"shortcuts.":[130],"Shortcut":[131],"derived":[135],"lazily":[136],"from":[137],"stored":[139],"perform":[142],"experimental":[144],"set":[148],"real":[150],"world":[151],"instances":[152],"compare":[154],"our":[155],"approach":[156,161],"state-of-the-art":[158],"techniques.":[159],"Our":[160],"fastest":[164],"preprocessing,":[165],"competitive":[166],"up":[171],"38":[173],"smaller":[175],"indexes":[176],"than":[177],"competing":[178],"approaches.":[179]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-28T08:17:26.163206","created_date":"2019-11-08T00:00:00"}