{"id":"https://openalex.org/W1871367359","doi":"https://doi.org/10.1007/3-540-48318-7_4","title":"Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison","display_name":"Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1871367359","doi":"https://doi.org/10.1007/3-540-48318-7_4","mag":"1871367359"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48318-7_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48318-7_4","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/A5016783277","display_name":"V\u00edctor Jim\u00e9nez","orcid":"https://orcid.org/0000-0003-1197-0937"},"institutions":[{"id":"https://openalex.org/I10902133","display_name":"Universitat Jaume I","ror":"https://ror.org/02ws1xc11","country_code":"ES","type":"education","lineage":["https://openalex.org/I10902133"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"V\u00edctor M. Jim\u00e9nez","raw_affiliation_strings":["Departamento de Inform\u00e1tica, Universitat Jaume I, Castell\u00f3n, Spain"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universitat Jaume I, Castell\u00f3n, Spain","institution_ids":["https://openalex.org/I10902133"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044783157","display_name":"Andr\u00e9s Marzal","orcid":"https://orcid.org/0000-0001-6621-4915"},"institutions":[{"id":"https://openalex.org/I10902133","display_name":"Universitat Jaume I","ror":"https://ror.org/02ws1xc11","country_code":"ES","type":"education","lineage":["https://openalex.org/I10902133"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Andr\u00e9s Marzal","raw_affiliation_strings":["Departamento de Inform\u00e1tica, Universitat Jaume I, Castell\u00f3n, Spain"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica, Universitat Jaume I, Castell\u00f3n, Spain","institution_ids":["https://openalex.org/I10902133"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016783277"],"corresponding_institution_ids":["https://openalex.org/I10902133"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.1803,"has_fulltext":false,"cited_by_count":201,"citation_normalized_percentile":{"value":0.87784431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"15","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.800494372844696},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.7135233879089355},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6977105140686035},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6928924322128296},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6810122728347778},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6094233989715576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6092882752418518},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5856173038482666},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5635648965835571},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49475520849227905},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4772224724292755},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45785415172576904},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4128715693950653},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3271647095680237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30425262451171875},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20666974782943726},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1531512439250946}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.800494372844696},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.7135233879089355},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6977105140686035},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6928924322128296},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6810122728347778},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6094233989715576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6092882752418518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5856173038482666},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5635648965835571},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49475520849227905},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4772224724292755},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45785415172576904},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4128715693950653},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3271647095680237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30425262451171875},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20666974782943726},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1531512439250946},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-48318-7_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48318-7_4","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W84368950","https://openalex.org/W252202574","https://openalex.org/W1966557890","https://openalex.org/W1973804680","https://openalex.org/W2005309726","https://openalex.org/W2023132252","https://openalex.org/W2027442194","https://openalex.org/W2030169809","https://openalex.org/W2069295656","https://openalex.org/W2089957823","https://openalex.org/W2091243858","https://openalex.org/W2096099709","https://openalex.org/W2131058166","https://openalex.org/W2144050074","https://openalex.org/W2163526781","https://openalex.org/W2227557434","https://openalex.org/W2506596302","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2597144308","https://openalex.org/W4293054712","https://openalex.org/W2523719706","https://openalex.org/W2360981904","https://openalex.org/W2347245430","https://openalex.org/W2368964068","https://openalex.org/W2391130892","https://openalex.org/W2354846196","https://openalex.org/W2030169809","https://openalex.org/W2198982833"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}