{"id":"https://openalex.org/W2112513979","doi":"https://doi.org/10.1007/978-3-642-20662-7_20","title":"A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks","display_name":"A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2112513979","doi":"https://doi.org/10.1007/978-3-642-20662-7_20","mag":"2112513979"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20662-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20662-7_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in 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/A5078682514","display_name":"Ittai Abraham","orcid":"https://orcid.org/0000-0001-9568-7674"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ittai Abraham","raw_affiliation_strings":["Microsoft Research Silicon Valley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060646771","display_name":"Daniel Delling","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Delling","raw_affiliation_strings":["Microsoft Research Silicon Valley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Microsoft Research Silicon Valley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063407134","display_name":"Renato F. Werneck","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato F. Werneck","raw_affiliation_strings":["Microsoft Research Silicon Valley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5078682514"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":38.4596,"has_fulltext":false,"cited_by_count":259,"citation_normalized_percentile":{"value":0.99829497,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"230","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8036220669746399},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6368834972381592},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6056065559387207},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.582310140132904},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5776503086090088},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4230038523674011},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42139115929603577},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.33898985385894775},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29736316204071045},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18978914618492126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10486507415771484},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08213484287261963},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06434881687164307}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8036220669746399},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6368834972381592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6056065559387207},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.582310140132904},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5776503086090088},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4230038523674011},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42139115929603577},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.33898985385894775},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29736316204071045},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18978914618492126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10486507415771484},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08213484287261963},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06434881687164307},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-20662-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20662-7_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.726.6149","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.726.6149","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/%7Erwerneck/papers/ADGW11-hublabels-sea.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W190901240","https://openalex.org/W1493214567","https://openalex.org/W1513400187","https://openalex.org/W1528485123","https://openalex.org/W1583434898","https://openalex.org/W1592142404","https://openalex.org/W1993643838","https://openalex.org/W1994924587","https://openalex.org/W2009303970","https://openalex.org/W2014889099","https://openalex.org/W2022671649","https://openalex.org/W2025838844","https://openalex.org/W2034501275","https://openalex.org/W2041172083","https://openalex.org/W2045446569","https://openalex.org/W2083019227","https://openalex.org/W2095677000","https://openalex.org/W2101778955","https://openalex.org/W2109691905","https://openalex.org/W2112513979","https://openalex.org/W2120783268","https://openalex.org/W2127470768","https://openalex.org/W2129154450","https://openalex.org/W2137560895","https://openalex.org/W2148831787","https://openalex.org/W2150418461","https://openalex.org/W2153374077","https://openalex.org/W2168148394","https://openalex.org/W2169528473","https://openalex.org/W2501059503","https://openalex.org/W2575116237","https://openalex.org/W2579664199","https://openalex.org/W2609578772","https://openalex.org/W3022772499","https://openalex.org/W4242243468"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2939571613","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2761711678","https://openalex.org/W2170980056","https://openalex.org/W143403600","https://openalex.org/W2886722595"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":24},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":27},{"year":2014,"cited_by_count":27},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":17}],"updated_date":"2026-05-19T08:33:51.333923","created_date":"2025-10-10T00:00:00"}