{"id":"https://openalex.org/W2557980619","doi":"https://doi.org/10.1109/cec.2016.7744114","title":"Improving the computational efficiency of ripple-spreading algorithm for the k shortest paths problem","display_name":"Improving the computational efficiency of ripple-spreading algorithm for the k shortest paths problem","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2557980619","doi":"https://doi.org/10.1109/cec.2016.7744114","mag":"2557980619"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","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/A5079907239","display_name":"Xiao\u2010Bing Hu","orcid":"https://orcid.org/0000-0002-1555-0684"},"institutions":[{"id":"https://openalex.org/I25254941","display_name":"Beijing Normal University","ror":"https://ror.org/022k4wk35","country_code":"CN","type":"education","lineage":["https://openalex.org/I25254941"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiao-Bing Hu","raw_affiliation_strings":["Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China","institution_ids":["https://openalex.org/I25254941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008097973","display_name":"Ming-Kong Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I25254941","display_name":"Beijing Normal University","ror":"https://ror.org/022k4wk35","country_code":"CN","type":"education","lineage":["https://openalex.org/I25254941"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming-Kong Zhang","raw_affiliation_strings":["Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China","institution_ids":["https://openalex.org/I25254941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113552162","display_name":"Di He Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I137867983","display_name":"Central University of Finance and Economics","ror":"https://ror.org/008e3hf02","country_code":"CN","type":"education","lineage":["https://openalex.org/I137867983"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Di Hu","raw_affiliation_strings":["School of Statistics, Central University of Finance and Economics, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Statistics, Central University of Finance and Economics, Beijing, China","institution_ids":["https://openalex.org/I137867983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079907239"],"corresponding_institution_ids":["https://openalex.org/I25254941"],"apc_list":null,"apc_paid":null,"fwci":0.5513,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72076918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"35","issue":null,"first_page":"2604","last_page":"2609"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.98580002784729,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.98580002784729,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9740999937057495,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9535999894142151,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ripple","display_name":"Ripple","score":0.7249839901924133},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6197922229766846},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.612133264541626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5887097120285034},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5876981616020203},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.572336733341217},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.5397750735282898},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4603308439254761},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4466901123523712},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3390201926231384},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3362235724925995},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17968317866325378},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07106372714042664}],"concepts":[{"id":"https://openalex.org/C2779599953","wikidata":"https://www.wikidata.org/wiki/Q1776117","display_name":"Ripple","level":3,"score":0.7249839901924133},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6197922229766846},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.612133264541626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5887097120285034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5876981616020203},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.572336733341217},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.5397750735282898},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4603308439254761},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4466901123523712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3390201926231384},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3362235724925995},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17968317866325378},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07106372714042664},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Clean water and sanitation","id":"https://metadata.un.org/sdg/6"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W563824333","https://openalex.org/W1517411378","https://openalex.org/W2011282943","https://openalex.org/W2045094735","https://openalex.org/W2058725370","https://openalex.org/W2089845007","https://openalex.org/W2094004254","https://openalex.org/W2121101044","https://openalex.org/W2122516422","https://openalex.org/W2131058166","https://openalex.org/W2134531349","https://openalex.org/W2160019827","https://openalex.org/W3185458812","https://openalex.org/W6631015714","https://openalex.org/W6799142695"],"related_works":["https://openalex.org/W4229441739","https://openalex.org/W4303411445","https://openalex.org/W4207040089","https://openalex.org/W2384455639","https://openalex.org/W2539674285","https://openalex.org/W1519622926","https://openalex.org/W3109306766","https://openalex.org/W2944076747","https://openalex.org/W4286587111","https://openalex.org/W3100302196"],"abstract_inverted_index":{"The":[0,89,141],"k":[1,78],"shortest":[2],"paths":[3],"problem":[4],"(k-SPP)":[5],"has":[6],"a":[7,20,85],"wide":[8],"application":[9],"background.":[10],"Inspired":[11],"by":[12],"the":[13,33,36,40,53,58,80,99,102,109,118,123,145,150],"natural":[14],"ripple-spreading":[15,29],"phenomenon":[16],"that":[17],"occurs":[18],"on":[19,108],"water":[21],"surface,":[22],"we":[23],"have":[24],"recently":[25],"proposed":[26,66,151],"an":[27,74],"original":[28],"algorithm":[30,42],"(RSA)":[31],"for":[32,57,117],"k-SPP.":[34,59],"However,":[35],"computational":[37,139],"efficiency":[38,148],"of":[39,55,77,83,114,149],"reported":[41],"is":[43,47,71,91],"poor.":[44],"This":[45],"paper":[46],"concerned":[48],"with":[49,135],"how":[50],"to":[51,72,92,132],"improve":[52],"scalability":[54],"RSA":[56,116,125],"To":[60],"this":[61,68],"end,":[62],"two":[63],"methods":[64],"are":[65,120],"in":[67,138],"study.":[69],"One":[70],"impose":[73],"upper":[75],"bound":[76],"as":[79],"maximal":[81],"number":[82],"ripples":[84],"node":[86],"may":[87],"generate.":[88],"other":[90],"start":[93],"ripple":[94],"relay":[95],"race":[96],"from":[97,129],"both":[98],"source":[100],"and":[101,111,147],"destination":[103],"simultaneously.":[104],"Some":[105],"theoretical":[106],"analyses":[107],"optimality":[110],"time":[112],"complexity":[113],"improved":[115,124],"k-SPP":[119,131],"given.":[121],"Surprisingly,":[122],"can":[126],"be":[127],"extended":[128],"one-to-one":[130],"one-to-all":[133],"k-SPP,":[134],"no":[136],"increase":[137],"complexity.":[140],"experimental":[142],"results":[143],"demonstrate":[144],"effectiveness":[146],"methods.":[152]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}