{"id":"https://openalex.org/W129719134","doi":"https://doi.org/10.1007/978-3-642-20009-0_50","title":"On Universal Shortest Paths","display_name":"On Universal Shortest Paths","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W129719134","doi":"https://doi.org/10.1007/978-3-642-20009-0_50","mag":"129719134"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20009-0_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20009-0_50","pdf_url":null,"source":{"id":"https://openalex.org/S4210184104","display_name":"Operations research proceedings","issn_l":"0721-5924","issn":["0721-5924","2197-9294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Proceedings","raw_type":"book-chapter"},"type":"article","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/A5081140532","display_name":"Lara Turner","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Lara Turner","raw_affiliation_strings":["Department of Mathematics, Technical University of Kaiserslautern, 3049, 67653, Kaiserslautern, Germany","University of Kaiserslautern;"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Kaiserslautern, 3049, 67653, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Kaiserslautern;","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111683448","display_name":"Horst W. Hamacher","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Horst W. Hamacher","raw_affiliation_strings":["Department of Mathematics, Technical University of Kaiserslautern, 3049, 67653, Kaiserslautern, Germany","University of Kaiserslautern;"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Kaiserslautern, 3049, 67653, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Kaiserslautern;","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081140532"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":0.7782,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71058824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"313","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9886000156402588,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9886000156402588,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9794999957084656,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9656999707221985,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7722675800323486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7045199871063232},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5790491700172424},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5556994080543518},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5246976613998413},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5001261234283447},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4860101640224457},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4518600404262543},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4511975646018982},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.42264753580093384},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4138602018356323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3977275490760803},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25555044412612915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18072134256362915}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7722675800323486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7045199871063232},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5790491700172424},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5556994080543518},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5246976613998413},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5001261234283447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4860101640224457},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4518600404262543},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4511975646018982},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.42264753580093384},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4138602018356323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3977275490760803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25555044412612915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18072134256362915},{"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-20009-0_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20009-0_50","pdf_url":null,"source":{"id":"https://openalex.org/S4210184104","display_name":"Operations research proceedings","issn_l":"0721-5924","issn":["0721-5924","2197-9294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Proceedings","raw_type":"book-chapter"},{"id":"pmh:oai:RePEc:spr:oprchp:978-3-642-20009-0_50","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"book"},{"id":"pmh:oai:kluedo.ub.rptu.de:2230","is_oa":false,"landing_page_url":"https://kluedo.ub.rptu.de/frontdoor/index/index/docId/2230","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"preprint"},{"id":"pmh:oai:kluedo.ub.uni-kl.de:2230","is_oa":false,"landing_page_url":"https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2230","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"preprint"},{"id":"mag:129719134","is_oa":false,"landing_page_url":"https://kluedo.ub.uni-kl.de/files/2230/Nr.128_Hamacher_Turner.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1543569861","https://openalex.org/W1557235141","https://openalex.org/W1975226165","https://openalex.org/W2037188497","https://openalex.org/W2053009572","https://openalex.org/W2060907774","https://openalex.org/W2125528794","https://openalex.org/W2150338193","https://openalex.org/W2151021662"],"related_works":["https://openalex.org/W2953016187","https://openalex.org/W2064901027","https://openalex.org/W2048751169","https://openalex.org/W2030870864","https://openalex.org/W3173650023","https://openalex.org/W2081287319","https://openalex.org/W239695998","https://openalex.org/W2174580729","https://openalex.org/W2164190739","https://openalex.org/W2063957068","https://openalex.org/W2907061525","https://openalex.org/W2409198285","https://openalex.org/W2918100086","https://openalex.org/W2166042729","https://openalex.org/W3123076862","https://openalex.org/W1514650040","https://openalex.org/W177082126","https://openalex.org/W1994247939","https://openalex.org/W2052551501","https://openalex.org/W2011847891"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}