{"id":"https://openalex.org/W4285012515","doi":"https://doi.org/10.1145/3490148.3538555","title":"Brief Announcement: A Parallel (\u0394, \u0393)-Stepping Algorithm for the Constrained Shortest Path Problem","display_name":"Brief Announcement: A Parallel (\u0394, \u0393)-Stepping Algorithm for the Constrained Shortest Path Problem","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285012515","doi":"https://doi.org/10.1145/3490148.3538555"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538555","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5024828530","display_name":"Tayebeh Bahreini","orcid":"https://orcid.org/0000-0001-7818-2674"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tayebeh Bahreini","raw_affiliation_strings":["Wayne State University, Detroit, MI, USA"],"affiliations":[{"raw_affiliation_string":"Wayne State University, Detroit, MI, USA","institution_ids":["https://openalex.org/I185443292"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063909745","display_name":"Nathan Fisher","orcid":"https://orcid.org/0000-0002-9733-3842"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Fisher","raw_affiliation_strings":["Wayne State University, Detroit, MI, USA"],"affiliations":[{"raw_affiliation_string":"Wayne State University, Detroit, MI, USA","institution_ids":["https://openalex.org/I185443292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030625845","display_name":"Daniel Grosu","orcid":"https://orcid.org/0000-0003-2340-5433"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Grosu","raw_affiliation_strings":["Wayne State University, Detroit, MI, USA"],"affiliations":[{"raw_affiliation_string":"Wayne State University, Detroit, MI, USA","institution_ids":["https://openalex.org/I185443292"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024828530"],"corresponding_institution_ids":["https://openalex.org/I185443292"],"apc_list":null,"apc_paid":null,"fwci":0.1007,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.36292141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"287","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7520073652267456},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7344803214073181},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.63163822889328},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6247957944869995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6097164154052734},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5948537588119507},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5818203687667847},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.538063645362854},{"id":"https://openalex.org/keywords/stepping-stone","display_name":"Stepping stone","score":0.5075696706771851},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.50678950548172},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4793965816497803},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.47048643231391907},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43183690309524536},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4281045198440552},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4147164225578308},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3503536880016327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33501508831977844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24993818998336792},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12661346793174744}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7520073652267456},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7344803214073181},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.63163822889328},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6247957944869995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6097164154052734},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5948537588119507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5818203687667847},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.538063645362854},{"id":"https://openalex.org/C3019463535","wikidata":"https://www.wikidata.org/wiki/Q7611136","display_name":"Stepping stone","level":3,"score":0.5075696706771851},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.50678950548172},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4793965816497803},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.47048643231391907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43183690309524536},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4281045198440552},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4147164225578308},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3503536880016327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33501508831977844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24993818998336792},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12661346793174744},{"id":"https://openalex.org/C2778126366","wikidata":"https://www.wikidata.org/wiki/Q41171","display_name":"Unemployment","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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.1145/3490148.3538555","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2057112598","https://openalex.org/W2159176259","https://openalex.org/W2408262133","https://openalex.org/W3173178143"],"related_works":["https://openalex.org/W4321491762","https://openalex.org/W2384965074","https://openalex.org/W2462581792","https://openalex.org/W2776102956","https://openalex.org/W1974495461","https://openalex.org/W4210697296","https://openalex.org/W2001902288","https://openalex.org/W2741593378","https://openalex.org/W2124626211","https://openalex.org/W4281401204"],"abstract_inverted_index":{"We":[0],"design":[1,32,43],"a":[2,23],"parallel":[3,34],"algorithm":[4,27,47],"for":[5,48],"the":[6,33,38,42,45,49],"Constrained":[7],"Shortest":[8],"Path":[9],"(CSP)":[10],"problem.":[11,53],"The":[12],"CSP":[13],"problem":[14],"is":[15],"known":[16],"to":[17],"be":[18],"NP-hard":[19],"and":[20],"there":[21],"exists":[22],"pseudo-polynomial":[24],"time":[25],"sequential":[26],"that":[28],"solves":[29],"it.":[30],"To":[31],"algorithm,":[35],"we":[36],"extend":[37],"techniques":[39],"used":[40],"in":[41],"of":[44],"\u0394-stepping":[46],"single-source":[50],"shortest":[51],"paths":[52]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}