{"id":"https://openalex.org/W2571933368","doi":"https://doi.org/10.1090/dimacs/074/08","title":"Robust, almost constant time shortest-path queries in road networks","display_name":"Robust, almost constant time shortest-path queries in road networks","publication_year":2009,"publication_date":"2009-07-28","ids":{"openalex":"https://openalex.org/W2571933368","doi":"https://doi.org/10.1090/dimacs/074/08","mag":"2571933368"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/074/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Sanders","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067985737","display_name":"Dominik Schultes","orcid":"https://orcid.org/0000-0002-1439-3904"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dominik Schultes","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082922326"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7171,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86435185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9896000027656555,"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"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7210614085197449},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6751890778541565},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6462382674217224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.638096272945404},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6132587194442749},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5289642214775085},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4915035665035248},{"id":"https://openalex.org/keywords/transit","display_name":"Transit (satellite)","score":0.45911285281181335},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.4128310978412628},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3928091824054718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2818165719509125},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.24266543984413147},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.14158746600151062},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.13668006658554077},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11135908961296082},{"id":"https://openalex.org/keywords/public-transport","display_name":"Public transport","score":0.09123966097831726},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08151987195014954}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7210614085197449},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6751890778541565},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6462382674217224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.638096272945404},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6132587194442749},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5289642214775085},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4915035665035248},{"id":"https://openalex.org/C2778022998","wikidata":"https://www.wikidata.org/wiki/Q651136","display_name":"Transit (satellite)","level":3,"score":0.45911285281181335},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.4128310978412628},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3928091824054718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2818165719509125},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.24266543984413147},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.14158746600151062},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.13668006658554077},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11135908961296082},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.09123966097831726},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08151987195014954},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/074/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.1043","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.1043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dis.uniroma1.it/~challenge9/papers/sanders.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.7007","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.7007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://algo2.iti.uni-karlsruhe.de/schultes/hwy/hhTransit.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W127515624","https://openalex.org/W175307687","https://openalex.org/W1489554686","https://openalex.org/W1493214567","https://openalex.org/W1528485123","https://openalex.org/W1559814459","https://openalex.org/W1561240874","https://openalex.org/W1583434898","https://openalex.org/W1592142404","https://openalex.org/W1810931192","https://openalex.org/W1969483458","https://openalex.org/W2014889099","https://openalex.org/W2101778955","https://openalex.org/W2151400766","https://openalex.org/W2152545366","https://openalex.org/W2169528473","https://openalex.org/W2184615329","https://openalex.org/W2439405256","https://openalex.org/W2494779131","https://openalex.org/W2768149714"],"related_works":["https://openalex.org/W1580193255","https://openalex.org/W2024922736","https://openalex.org/W857597006","https://openalex.org/W2588038031","https://openalex.org/W2266281878","https://openalex.org/W3017792581","https://openalex.org/W3158546598","https://openalex.org/W619657985","https://openalex.org/W1990125634","https://openalex.org/W2105586767"],"abstract_inverted_index":{"When":[0],"you":[1,7],"drive":[2],"to":[3,37,44,106],"somewhere":[4],"\u2018far":[5],"away\u2019,":[6],"will":[8],"leave":[9],"your":[10],"current":[11],"location":[12],"via":[13],"one":[14,90],"of":[15,48,63,84,110],"only":[16,115],"a":[17,29,45],"few":[18],"\u2018important\u2019":[19],"traffic":[20],"junctions.":[21],"Starting":[22],"from":[23],"this":[24,53],"informal":[25],"observation,":[26],"we":[27],"develop":[28],"generic":[30],"algorithmic":[31],"approach\u2014transit":[32],"node":[33],"routing\u2014that":[34],"allows":[35],"us":[36],"reduce":[38],"quickest-path":[39],"queries":[40],"in":[41],"road":[42,61],"networks":[43],"small":[46],"number":[47],"table":[49],"look-ups.":[50],"We":[51,102],"implement":[52],"basic":[54],"approach":[55],"using":[56],"highway":[57],"hierarchies.":[58],"For":[59],"the":[60,67,76,95],"maps":[62],"Western":[64],"Europe":[65],"and":[66],"United":[68],"States,":[69],"our":[70],"best":[71,77,96],"query":[72],"times":[73,92],"improve":[74],"over":[75],"previously":[78],"published":[79],"figures":[80],"by":[81],"two":[82],"orders":[83],"magnitude.":[85],"This":[86],"is":[87],"more":[88],"than":[89,94],"million":[91],"faster":[93],"known":[97],"algorithm":[98],"for":[99],"general":[100],"networks.":[101],"also":[103],"explain":[104],"how":[105],"compute":[107],"complete":[108],"descriptions":[109],"shortest":[111],"paths":[112],"(and":[113],"not":[114],"their":[116],"lengths)":[117],"very":[118],"efficiently.":[119]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}