{"id":"https://openalex.org/W2794083468","doi":"https://doi.org/10.1007/s00453-018-0414-9","title":"Path Refinement in Weighted Regions","display_name":"Path Refinement in Weighted Regions","publication_year":2018,"publication_date":"2018-02-16","ids":{"openalex":"https://openalex.org/W2794083468","doi":"https://doi.org/10.1007/s00453-018-0414-9","mag":"2794083468"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0414-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0414-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5076883589","display_name":"Amin Gheibi","orcid":"https://orcid.org/0000-0002-0364-7585"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]},{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA","IR"],"is_corresponding":true,"raw_author_name":"Amin Gheibi","raw_affiliation_strings":["Amirkabir University of Technology, Tehran, Iran","School of Computer Science, Carleton University, Ottawa, ON, Canada","School of Computer Science, Carleton University, Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"Amirkabir University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]},{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Anil Maheshwari","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, ON, Canada","School of Computer Science, Carleton University, Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085978384","display_name":"J\u00f6rg-R\u00fcdiger Sack","orcid":"https://orcid.org/0000-0001-5936-1319"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J\u00f6rg-R\u00fcdiger Sack","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, ON, Canada","School of Computer Science, Carleton University, Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080464077","display_name":"Christian Scheffer","orcid":"https://orcid.org/0000-0002-3471-2706"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Scheffer","raw_affiliation_strings":["Institute of Operating Systems and Computer Networks, Technische Universit\u00e4t Braunschweig, Brunswick, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Operating Systems and Computer Networks, Technische Universit\u00e4t Braunschweig, Brunswick, Germany","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5076883589"],"corresponding_institution_ids":["https://openalex.org/I158248296","https://openalex.org/I67031392"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4975,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62016719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"80","issue":"12","first_page":"3766","last_page":"3802"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.984499990940094,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6673669815063477},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6033867001533508},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5715498924255371},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5498415231704712},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5293594002723694},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5153693556785583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4648629128932953},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45425888895988464},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4368115961551666},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4326925575733185},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4315844178199768},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41202133893966675},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3892061710357666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3757758140563965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2655887007713318},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.23407670855522156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12282931804656982}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6673669815063477},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6033867001533508},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5715498924255371},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5498415231704712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5293594002723694},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5153693556785583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4648629128932953},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45425888895988464},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4368115961551666},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4326925575733185},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4315844178199768},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41202133893966675},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3892061710357666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3757758140563965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2655887007713318},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.23407670855522156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12282931804656982},{"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/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/s00453-018-0414-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0414-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W14248017","https://openalex.org/W1515543311","https://openalex.org/W1604715174","https://openalex.org/W1970303271","https://openalex.org/W1980197133","https://openalex.org/W1985888263","https://openalex.org/W1989723858","https://openalex.org/W2012691739","https://openalex.org/W2025130628","https://openalex.org/W2028769163","https://openalex.org/W2031235730","https://openalex.org/W2056616079","https://openalex.org/W2062892638","https://openalex.org/W2096576273","https://openalex.org/W2112346596","https://openalex.org/W2144015309","https://openalex.org/W2150591286","https://openalex.org/W2295337288","https://openalex.org/W2326628520","https://openalex.org/W2496675188","https://openalex.org/W2573715514","https://openalex.org/W4236430992"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W4200172719","https://openalex.org/W2112429204","https://openalex.org/W2305559042","https://openalex.org/W2365712669","https://openalex.org/W2018146256"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}