{"id":"https://openalex.org/W1584941324","doi":"https://doi.org/10.1007/3-540-45551-5_72","title":"On Shortest Path Problems with \u201cNon-Markovian\u201d Link Contribution to Path Lengths","display_name":"On Shortest Path Problems with \u201cNon-Markovian\u201d Link Contribution to Path Lengths","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1584941324","doi":"https://doi.org/10.1007/3-540-45551-5_72","mag":"1584941324"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45551-5_72","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45551-5_72","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/A5112853639","display_name":"Arunabha Sen","orcid":"https://orcid.org/0000-0002-5795-3465"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arunabha Sen","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, 85287, AZ, USA","Arizona State University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, 85287, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003070145","display_name":"K. Sel\u00e7uk Candan","orcid":"https://orcid.org/0000-0003-4977-6646"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Sel\u00e7uk Candan","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, 85287, AZ, USA","Arizona State University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, 85287, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110282068","display_name":"Afonso Ferreira","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Afonso Ferreira","raw_affiliation_strings":["SLOOP, CNRS - INRIA - UNSA, 2004 Rote des Lucioles, BP 93, F-06902, Sophia-Antipollis, France","SLOOP, CNRS - INRIA - UNSA"],"affiliations":[{"raw_affiliation_string":"SLOOP, CNRS - INRIA - UNSA, 2004 Rote des Lucioles, BP 93, F-06902, Sophia-Antipollis, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"SLOOP, CNRS - INRIA - UNSA","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052072507","display_name":"Bruno Beauquier","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bruno Beauquier","raw_affiliation_strings":["SLOOP, CNRS - INRIA - UNSA, 2004 Rote des Lucioles, BP 93, F-06902, Sophia-Antipollis, France","SLOOP, CNRS - INRIA - UNSA"],"affiliations":[{"raw_affiliation_string":"SLOOP, CNRS - INRIA - UNSA, 2004 Rote des Lucioles, BP 93, F-06902, Sophia-Antipollis, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"SLOOP, CNRS - INRIA - UNSA","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108373946","display_name":"St\u00e9phane P\u00e9renn\u00e8s","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Stephane Perennes","raw_affiliation_strings":["SLOOP, CNRS - INRIA - UNSA, 2004 Rote des Lucioles, BP 93, F-06902, Sophia-Antipollis, France","SLOOP, CNRS - INRIA - UNSA"],"affiliations":[{"raw_affiliation_string":"SLOOP, CNRS - INRIA - UNSA, 2004 Rote des Lucioles, BP 93, F-06902, Sophia-Antipollis, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"SLOOP, CNRS - INRIA - UNSA","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5112853639"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.15401302,"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":"859","last_page":"870"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.996999979019165,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8161860108375549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7676547765731812},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.7015122175216675},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6732191443443298},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6314345002174377},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6093496084213257},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5981884002685547},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.5354360342025757},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.4887830913066864},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.48427075147628784},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47122204303741455},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4643210768699646},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4484368860721588},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.41003215312957764},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38239413499832153},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3736698031425476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36819159984588623},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21136802434921265},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12995359301567078},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11908599734306335},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10309484601020813},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08675384521484375}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8161860108375549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7676547765731812},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.7015122175216675},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6732191443443298},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6314345002174377},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6093496084213257},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5981884002685547},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.5354360342025757},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.4887830913066864},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.48427075147628784},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47122204303741455},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4643210768699646},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4484368860721588},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.41003215312957764},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38239413499832153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3736698031425476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36819159984588623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21136802434921265},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12995359301567078},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11908599734306335},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10309484601020813},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08675384521484375},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45551-5_72","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45551-5_72","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1964443412","https://openalex.org/W1997102717","https://openalex.org/W2053697731","https://openalex.org/W2065006817","https://openalex.org/W2076759821","https://openalex.org/W2089338760","https://openalex.org/W2096774592","https://openalex.org/W2110108508","https://openalex.org/W2127456145","https://openalex.org/W2151688044","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2494779131","https://openalex.org/W2613173048","https://openalex.org/W4252207957"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W4321491762","https://openalex.org/W2384965074","https://openalex.org/W1974495461","https://openalex.org/W1584941324","https://openalex.org/W2367517663","https://openalex.org/W2462581792","https://openalex.org/W2469944050","https://openalex.org/W1985494011","https://openalex.org/W3032870653"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}