{"id":"https://openalex.org/W2148831787","doi":"https://doi.org/10.1007/978-3-540-68552-4_24","title":"Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks","display_name":"Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks","publication_year":2008,"publication_date":"2008-05-28","ids":{"openalex":"https://openalex.org/W2148831787","doi":"https://doi.org/10.1007/978-3-540-68552-4_24","mag":"2148831787"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-68552-4_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68552-4_24","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/A5041710251","display_name":"Robert Geisberger","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert Geisberger","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Sanders","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany","institution_ids":[]}]},{"author_position":"middle","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":["Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060646771","display_name":"Daniel Delling","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Delling","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), 76128, Karlsruhe, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5041710251"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":39.9161,"has_fulltext":false,"cited_by_count":704,"citation_normalized_percentile":{"value":1.0,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"319","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9972000122070312,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9937999844551086,"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/computer-science","display_name":"Computer science","score":0.8087968230247498},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.6788111925125122},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.510615885257721},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.37834492325782776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3525972366333008}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8087968230247498},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.6788111925125122},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.510615885257721},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37834492325782776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3525972366333008},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-68552-4_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68552-4_24","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W104675468","https://openalex.org/W160678529","https://openalex.org/W190901240","https://openalex.org/W1493214567","https://openalex.org/W1497045044","https://openalex.org/W1513185775","https://openalex.org/W1520740947","https://openalex.org/W1559814459","https://openalex.org/W1583434898","https://openalex.org/W1764186747","https://openalex.org/W1810931192","https://openalex.org/W1866249310","https://openalex.org/W1969483458","https://openalex.org/W1971937094","https://openalex.org/W2009303970","https://openalex.org/W2014889099","https://openalex.org/W2078443814","https://openalex.org/W2083019227","https://openalex.org/W2101778955","https://openalex.org/W2120783268","https://openalex.org/W2127470768","https://openalex.org/W2132044905","https://openalex.org/W2150418461","https://openalex.org/W2151400766","https://openalex.org/W2155474419","https://openalex.org/W2169528473","https://openalex.org/W2288961969","https://openalex.org/W2501059503","https://openalex.org/W2506178054","https://openalex.org/W2561675875","https://openalex.org/W2576197549","https://openalex.org/W2768149714","https://openalex.org/W2982996625","https://openalex.org/W2988711602","https://openalex.org/W4211173878","https://openalex.org/W4294550911"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":40},{"year":2024,"cited_by_count":33},{"year":2023,"cited_by_count":31},{"year":2022,"cited_by_count":35},{"year":2021,"cited_by_count":57},{"year":2020,"cited_by_count":51},{"year":2019,"cited_by_count":54},{"year":2018,"cited_by_count":42},{"year":2017,"cited_by_count":31},{"year":2016,"cited_by_count":46},{"year":2015,"cited_by_count":37},{"year":2014,"cited_by_count":55},{"year":2013,"cited_by_count":62},{"year":2012,"cited_by_count":38}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
