{"id":"https://openalex.org/W2112643276","doi":"https://doi.org/10.1142/s0129054199000186","title":"DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS","display_name":"DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS","publication_year":1999,"publication_date":"1999-09-01","ids":{"openalex":"https://openalex.org/W2112643276","doi":"https://doi.org/10.1142/s0129054199000186","mag":"2112643276"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054199000186","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054199000186","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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/A5110009500","display_name":"Ernesto de Queir\u00f3s Vieira Martins","orcid":null},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"ERNESTO DE QUEIR\u00d3S VIEIRA MARTINS","raw_affiliation_strings":["Centro de Inform\u00e1tica e Sistemas da Universidade de Coimbra, Departamento de Matem\u00e1tica, Universidade de Coimbra, Apartado 3008, 3000 Coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"Centro de Inform\u00e1tica e Sistemas da Universidade de Coimbra, Departamento de Matem\u00e1tica, Universidade de Coimbra, Apartado 3008, 3000 Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085879438","display_name":"Marta Pascoal","orcid":"https://orcid.org/0000-0003-0517-677X"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"MARTA MARGARIDA BRAZ PASCOAL","raw_affiliation_strings":["Centro de Inform\u00e1tica e Sistemas da Universidade de Coimbra, Departamento de Matem\u00e1tica, Universidade de Coimbra, Apartado 3008, 3000 Coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"Centro de Inform\u00e1tica e Sistemas da Universidade de Coimbra, Departamento de Matem\u00e1tica, Universidade de Coimbra, Apartado 3008, 3000 Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100608390","display_name":"Jos\u00e9 Lu\u00eds Santos","orcid":"https://orcid.org/0000-0002-2727-6774"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"JOS\u00c9 LUIS ESTEVES DOS SANTOS","raw_affiliation_strings":["Centro de Inform\u00e1tica e Sistemas da Universidade de Coimbra, Departamento de Matem\u00e1tica, Universidade de Coimbra, Apartado 3008, 3000 Coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"Centro de Inform\u00e1tica e Sistemas da Universidade de Coimbra, Departamento de Matem\u00e1tica, Universidade de Coimbra, Apartado 3008, 3000 Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110009500"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":null,"apc_paid":null,"fwci":0.7492,"has_fulltext":false,"cited_by_count":156,"citation_normalized_percentile":{"value":0.73747637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"10","issue":"03","first_page":"247","last_page":"261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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.9987999796867371,"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.9966999888420105,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.8357352018356323},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8192776441574097},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.702838659286499},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6540901064872742},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6312866806983948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6217943429946899},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5675705671310425},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5474997758865356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5223968029022217},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46206578612327576},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.458257794380188},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.43591511249542236},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.41368600726127625},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4121840000152588},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34362107515335083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34154239296913147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33459433913230896},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.24694383144378662},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1388028860092163},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06264039874076843}],"concepts":[{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.8357352018356323},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8192776441574097},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.702838659286499},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6540901064872742},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6312866806983948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6217943429946899},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5675705671310425},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5474997758865356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5223968029022217},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46206578612327576},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.458257794380188},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.43591511249542236},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41368600726127625},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4121840000152588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34362107515335083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34154239296913147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33459433913230896},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.24694383144378662},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1388028860092163},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06264039874076843},{"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.1142/s0129054199000186","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054199000186","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.4573","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4573","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mat.uc.pt/~eqvm/cientificos/investigacao/Artigos/deviation.ps.gz","raw_type":"text"},{"id":"pmh:oai:re.public.polimi.it:11311/1292951","is_oa":false,"landing_page_url":"https://hdl.handle.net/11311/1292951","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323392","display_name":"Universidade de Coimbra","ror":"https://ror.org/04z8k9a98"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W1583205259","https://openalex.org/W1973804680","https://openalex.org/W2005309726","https://openalex.org/W2011282943","https://openalex.org/W2027442194","https://openalex.org/W2030169809","https://openalex.org/W2058489727","https://openalex.org/W2061159212","https://openalex.org/W2069916913","https://openalex.org/W2071852134","https://openalex.org/W2078948975","https://openalex.org/W2084224084","https://openalex.org/W2089845007","https://openalex.org/W2089957823","https://openalex.org/W2131058166","https://openalex.org/W2144050074","https://openalex.org/W2154434560","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W4200172719","https://openalex.org/W2368964068","https://openalex.org/W2562562750","https://openalex.org/W4321491762","https://openalex.org/W2161960576","https://openalex.org/W1617152041","https://openalex.org/W2384965074"],"abstract_inverted_index":{"The":[0,14],"shortest":[1,21,28,66,87,123],"path":[2],"problem":[3,8,15,89,149],"is":[4,35,126],"a":[5,31,37,81,117],"classical":[6,38],"network":[7],"that":[9,129],"has":[10,41],"been":[11,43],"extensively":[12],"studied.":[13],"of":[16,55,80,120],"determining":[17],"not":[18,42,134],"only":[19],"the":[20,26,60,63,71,78,84,91,112,121,138,143,147],"path,":[22,82],"but":[23,40],"also":[24,36,127],"listing":[25],"K":[27,65,86,122],"paths":[29,67,88,92,132],"(for":[30],"given":[32],"integer":[33],"K>1)":[34],"one":[39],"studied":[44],"so":[45],"intensively,":[46],"despite":[47],"its":[48],"obvious":[49],"practical":[50],"interest.":[51],"Two":[52],"different":[53],"types":[54],"problems":[56],"are":[57,109],"usually":[58],"considered:":[59],"unconstrained":[61,148],"and":[62,141],"constrained":[64,85],"problem.":[68],"While":[69],"in":[70,75,77,83,136],"former":[72],"no":[73],"restriction":[74],"considered":[76],"definition":[79],"all":[90],"have":[93],"to":[94,101],"satisfy":[95],"some":[96],"condition":[97],"\u2013":[98],"for":[99,111,146,153],"example,":[100],"be":[102,151],"loopless.":[103],"In":[104],"this":[105],"paper":[106],"new":[107],"algorithms":[108,145],"proposed":[110,144],"uncontrained":[113],"problem,":[114],"which":[115],"compute":[116],"super":[118],"set":[119],"paths.":[124,156],"It":[125],"shown":[128],"ranking":[130,154],"loopless":[131,155],"does":[133],"hold":[135],"general":[137],"Optimality":[139],"Principle":[140],"how":[142],"can":[150],"adapted":[152]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}