{"id":"https://openalex.org/W2164399552","doi":"https://doi.org/10.2200/s00618ed1v01y201412tcs001","title":"The Shortest-Path Problem: Analysis and Comparison of Methods","display_name":"The Shortest-Path Problem: Analysis and Comparison of Methods","publication_year":2014,"publication_date":"2014-12-04","ids":{"openalex":"https://openalex.org/W2164399552","doi":"https://doi.org/10.2200/s00618ed1v01y201412tcs001","mag":"2164399552"},"language":"en","primary_location":{"id":"doi:10.2200/s00618ed1v01y201412tcs001","is_oa":false,"landing_page_url":"https://doi.org/10.2200/s00618ed1v01y201412tcs001","pdf_url":null,"source":{"id":"https://openalex.org/S4210225371","display_name":"Synthesis lectures on theoretical computer science","issn_l":"2376-9718","issn":["2376-9718","2376-9726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322570","host_organization_name":"Morgan & Claypool Publishers","host_organization_lineage":["https://openalex.org/P4310322570"],"host_organization_lineage_names":["Morgan & Claypool Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Synthesis Lectures on Theoretical Computer Science","raw_type":"journal-article"},"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/A5043746901","display_name":"Hector Ortega\u2010Arranz","orcid":null},"institutions":[{"id":"https://openalex.org/I108103353","display_name":"Universidad de Valladolid","ror":"https://ror.org/01fvbaw18","country_code":"ES","type":"education","lineage":["https://openalex.org/I108103353"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Hector Ortega-Arranz","raw_affiliation_strings":["Universidad de Valladolid, Spain"],"affiliations":[{"raw_affiliation_string":"Universidad de Valladolid, Spain","institution_ids":["https://openalex.org/I108103353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043394187","display_name":"Diego R. Llanos","orcid":"https://orcid.org/0000-0001-6240-9109"},"institutions":[{"id":"https://openalex.org/I108103353","display_name":"Universidad de Valladolid","ror":"https://ror.org/01fvbaw18","country_code":"ES","type":"education","lineage":["https://openalex.org/I108103353"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Diego R. Llanos","raw_affiliation_strings":["Universidad de Valladolid, Spain"],"affiliations":[{"raw_affiliation_string":"Universidad de Valladolid, Spain","institution_ids":["https://openalex.org/I108103353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025222271","display_name":"Arturo Gonz\u00e1lez-Escribano","orcid":"https://orcid.org/0000-0003-1309-9321"},"institutions":[{"id":"https://openalex.org/I108103353","display_name":"Universidad de Valladolid","ror":"https://ror.org/01fvbaw18","country_code":"ES","type":"education","lineage":["https://openalex.org/I108103353"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Arturo Gonzalez-Escribano","raw_affiliation_strings":["Universidad de Valladolid, Spain"],"affiliations":[{"raw_affiliation_string":"Universidad de Valladolid, Spain","institution_ids":["https://openalex.org/I108103353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043746901"],"corresponding_institution_ids":["https://openalex.org/I108103353"],"apc_list":null,"apc_paid":null,"fwci":1.4712,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.8353954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"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.9986000061035156,"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.9943000078201294,"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.9940000176429749,"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.8793731927871704},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.737705647945404},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6863924264907837},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5706946849822998},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5400067567825317},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5059165358543396},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5007729530334473},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4868701994419098},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.469168484210968},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4474326968193054},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4285995662212372},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4068967401981354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3877120614051819},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2481309473514557},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24317175149917603}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8793731927871704},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.737705647945404},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6863924264907837},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5706946849822998},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5400067567825317},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5059165358543396},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5007729530334473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4868701994419098},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.469168484210968},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4474326968193054},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4285995662212372},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4068967401981354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3877120614051819},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2481309473514557},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24317175149917603},{"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.2200/s00618ed1v01y201412tcs001","is_oa":false,"landing_page_url":"https://doi.org/10.2200/s00618ed1v01y201412tcs001","pdf_url":null,"source":{"id":"https://openalex.org/S4210225371","display_name":"Synthesis lectures on theoretical computer science","issn_l":"2376-9718","issn":["2376-9718","2376-9726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322570","host_organization_name":"Morgan & Claypool Publishers","host_organization_lineage":["https://openalex.org/P4310322570"],"host_organization_lineage_names":["Morgan & Claypool Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Synthesis Lectures on Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-030150328","is_oa":false,"landing_page_url":"https://doi.org/10.2200/S00618ED1V01Y201412TCS001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"software, multimedia"},{"id":"pmh:oai:cds.cern.ch:1985826","is_oa":false,"landing_page_url":"http://cds.cern.ch/record/1985826","pdf_url":null,"source":{"id":"https://openalex.org/S2765065519","display_name":"CERN Bulletin","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4327876864","host_organization_name":"CERN Publications","host_organization_lineage":["https://openalex.org/P4327876864"],"host_organization_lineage_names":["CERN Publications"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1489358540","https://openalex.org/W1493214567","https://openalex.org/W1561240874","https://openalex.org/W1583434898","https://openalex.org/W1591854528","https://openalex.org/W1597203970","https://openalex.org/W1673383737","https://openalex.org/W1764186747","https://openalex.org/W1866249310","https://openalex.org/W1920501755","https://openalex.org/W1969428227","https://openalex.org/W1999545213","https://openalex.org/W2009303970","https://openalex.org/W2009987517","https://openalex.org/W2011824721","https://openalex.org/W2014356136","https://openalex.org/W2019003829","https://openalex.org/W2038643780","https://openalex.org/W2062519180","https://openalex.org/W2068703182","https://openalex.org/W2071974437","https://openalex.org/W2084224084","https://openalex.org/W2091635795","https://openalex.org/W2095677000","https://openalex.org/W2101923813","https://openalex.org/W2112513979","https://openalex.org/W2120783268","https://openalex.org/W2132044905","https://openalex.org/W2144050074","https://openalex.org/W2144375401","https://openalex.org/W2146583842","https://openalex.org/W2148831787","https://openalex.org/W2149964853","https://openalex.org/W2169528473","https://openalex.org/W2596701433","https://openalex.org/W2768149714","https://openalex.org/W2952476710","https://openalex.org/W2982996625","https://openalex.org/W3141776272","https://openalex.org/W4294550911","https://openalex.org/W4301216918","https://openalex.org/W4372046852","https://openalex.org/W6675622114","https://openalex.org/W7139033639"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2365712669","https://openalex.org/W4200172719","https://openalex.org/W2776102956","https://openalex.org/W2388410942","https://openalex.org/W2040572217","https://openalex.org/W2612665926"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}