{"id":"https://openalex.org/W4387185483","doi":"https://doi.org/10.3233/faia230567","title":"A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates","display_name":"A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates","publication_year":2023,"publication_date":"2023-09-28","ids":{"openalex":"https://openalex.org/W4387185483","doi":"https://doi.org/10.3233/faia230567"},"language":"en","primary_location":{"id":"doi:10.3233/faia230567","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3233/faia230567","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230567","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230567","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102848131","display_name":"Eyal Weiss","orcid":"https://orcid.org/0000-0003-0508-6213"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Eyal Weiss","raw_affiliation_strings":["Bar-Ilan University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan University","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Felner","raw_affiliation_strings":["Ben-Gurion University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012168199","display_name":"Gal A. Kaminka","orcid":"https://orcid.org/0000-0001-8341-322X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gal A. Kaminka","raw_affiliation_strings":["Bar-Ilan University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan University","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102848131"],"corresponding_institution_ids":["https://openalex.org/I13955877"],"apc_list":null,"apc_paid":null,"fwci":2.9908,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.93279893,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9765999913215637,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9746000170707703,"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.8691707849502563},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.7564489245414734},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7120110392570496},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5791661143302917},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.575783908367157},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.575606644153595},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5247000455856323},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5238844752311707},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5231636762619019},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4745900332927704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4466542899608612},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.44642189145088196},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42173975706100464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3532612919807434},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2932516932487488},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2476797103881836},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18050047755241394}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8691707849502563},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.7564489245414734},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7120110392570496},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5791661143302917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.575783908367157},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.575606644153595},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5247000455856323},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5238844752311707},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5231636762619019},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4745900332927704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4466542899608612},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.44642189145088196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42173975706100464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3532612919807434},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2932516932487488},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2476797103881836},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18050047755241394},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia230567","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3233/faia230567","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230567","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia230567","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3233/faia230567","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230567","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G846456206","display_name":null,"funder_award_id":"2306/18","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321449","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495"},{"id":"https://openalex.org/F4320322248","display_name":"Israel Academy of Sciences and Humanities","ror":"https://ror.org/03c6c9520"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387185483.pdf","grobid_xml":"https://content.openalex.org/works/W4387185483.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W56424148","https://openalex.org/W588504562","https://openalex.org/W657703869","https://openalex.org/W1494534478","https://openalex.org/W1585557683","https://openalex.org/W1586244921","https://openalex.org/W1973193054","https://openalex.org/W2046915582","https://openalex.org/W2062568266","https://openalex.org/W2140883685","https://openalex.org/W2293499200","https://openalex.org/W2574340238","https://openalex.org/W2575085568","https://openalex.org/W2740036433","https://openalex.org/W2760721253","https://openalex.org/W2767772787","https://openalex.org/W2926153681","https://openalex.org/W3101355526","https://openalex.org/W4281747979","https://openalex.org/W4297336578","https://openalex.org/W4382866726","https://openalex.org/W6602375002"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2018146256","https://openalex.org/W2156431668","https://openalex.org/W2365712669","https://openalex.org/W2388410942","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W4200172719","https://openalex.org/W4293054712"],"abstract_inverted_index":{"The":[0],"shortest":[1,53],"path":[2,54,63],"problem":[3,59],"in":[4],"graphs":[5],"is":[6],"a":[7,24,62],"cornerstone":[8],"of":[9,51,60],"AI":[10],"theory":[11],"and":[12,43,82],"applications.":[13],"Existing":[14],"algorithms":[15,77],"generally":[16],"ignore":[17],"edge":[18,32],"weight":[19,33],"computation":[20],"time.":[21],"We":[22,56,72],"present":[23,74],"generalized":[25,49,80],"framework":[26],"for":[27,78],"weighted":[28],"directed":[29],"graphs,":[30],"where":[31],"can":[34],"be":[35],"computed":[36],"(estimated)":[37],"multiple":[38],"times,":[39],"at":[40],"increasing":[41],"accuracy":[42],"run-time":[44],"expense.":[45],"This":[46],"raises":[47],"several":[48],"variants":[50],"the":[52,58,65,69,79],"problem.":[55],"introduce":[57],"finding":[61],"with":[64],"tightest":[66],"lower-bound":[67],"on":[68],"optimal":[70],"cost.":[71],"then":[73],"two":[75],"complete":[76],"problem,":[81],"empirically":[83],"demonstrate":[84],"their":[85],"efficacy.":[86]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}