{"id":"https://openalex.org/W2046656276","doi":"https://doi.org/10.1145/2442942.2442943","title":"Real-world route planning","display_name":"Real-world route planning","publication_year":2012,"publication_date":"2012-11-06","ids":{"openalex":"https://openalex.org/W2046656276","doi":"https://doi.org/10.1145/2442942.2442943","mag":"2046656276"},"language":"en","primary_location":{"id":"doi:10.1145/2442942.2442943","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2442942.2442943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science","raw_type":"proceedings-article"},"type":"conference-paper","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/A5063407134","display_name":"Renato F. Werneck","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Renato F. Werneck","raw_affiliation_strings":["Microsoft Research Silicon Valley","Microsoft Research, Silicon, Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I4210124949"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063407134"],"corresponding_institution_ids":["https://openalex.org/I4210124949"],"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":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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.9976999759674072,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.777748703956604},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7221767902374268},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6901329755783081},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6241989135742188},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5593568086624146},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4686426818370819},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.43451473116874695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3944615423679352},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33686578273773193},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23226898908615112},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.20400115847587585}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.777748703956604},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7221767902374268},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6901329755783081},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6241989135742188},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5593568086624146},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4686426818370819},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.43451473116874695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3944615423679352},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33686578273773193},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23226898908615112},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.20400115847587585},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2442942.2442943","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2442942.2442943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W190901240","https://openalex.org/W1920501755","https://openalex.org/W2083019227","https://openalex.org/W2112513979","https://openalex.org/W2143083884","https://openalex.org/W2153374077","https://openalex.org/W2169528473","https://openalex.org/W2264601843","https://openalex.org/W2575116237"],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2360924501","https://openalex.org/W2766237626","https://openalex.org/W2372895815","https://openalex.org/W2167833628","https://openalex.org/W2349474539","https://openalex.org/W2366583813","https://openalex.org/W2365264209","https://openalex.org/W4281622723","https://openalex.org/W2385737134"],"abstract_inverted_index":{"Computing":[0],"driving":[1,104],"directions":[2],"in":[3,15,40,60],"road":[4,89],"networks":[5,90],"is":[6,24,53],"a":[7,68,94],"fundamental":[8],"problem.":[9],"Although":[10],"it":[11],"can":[12],"be":[13],"solved":[14],"essentially":[16],"linear":[17],"time":[18],"by":[19],"Dijkstra's":[20],"algorithm":[21],"[6],":[22],"this":[23,76],"not":[25],"fast":[26],"enough":[27],"to":[28,56,92],"enable":[29],"interactive":[30],"queries":[31,59],"on":[32,85],"large-scale":[33],"inputs.":[34],"Instead,":[35],"modern":[36],"algorithms":[37],"typically":[38],"work":[39,99],"two":[41],"stages:":[42],"first":[43],"an":[44],"offline":[45],"preprocessing":[46],"routine":[47],"computes":[48],"some":[49],"auxiliary":[50],"data,":[51],"which":[52],"then":[54],"used":[55],"answer":[57],"exact":[58],"real":[61],"time.":[62],"The":[63],"past":[64],"decade":[65],"has":[66],"seen":[67],"surprisingly":[69],"diverse":[70],"set":[71],"of":[72],"techniques":[73],"that":[74,88],"follow":[75],"approach":[77],"[1,":[78],"2,":[79],"7,":[80],"8,":[81],"9],":[82],"mostly":[83],"relying":[84],"the":[86],"fact":[87],"tend":[91],"have":[93],"strong":[95],"hierarchy.":[96],"These":[97],"methods":[98],"very":[100],"well":[101],"when":[102],"minimizing":[103],"times,":[105],"but":[106],"are":[107],"much":[108],"less":[109],"efficient":[110],"with":[111],"other":[112],"cost":[113],"functions.":[114]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}