{"id":"https://openalex.org/W1972373016","doi":"https://doi.org/10.1142/s012905411350007x","title":"A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM","display_name":"A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W1972373016","doi":"https://doi.org/10.1142/s012905411350007x","mag":"1972373016"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411350007x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411350007x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5075982551","display_name":"Javad Akbari Torkestani","orcid":"https://orcid.org/0000-0002-3824-7813"},"institutions":[{"id":"https://openalex.org/I2801771032","display_name":"Islamic Azad University, Arak","ror":"https://ror.org/02558wk32","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I2801771032"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"JAVAD AKBARI TORKESTANI","raw_affiliation_strings":["Department of Computer Engineering, Arak Branch, Islamic Azad University, Arak, Iran","Department of Computer Engineering, Arak Branch , Islamic Azad University , Arak , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Arak Branch, Islamic Azad University, Arak, Iran","institution_ids":["https://openalex.org/I2801771032"]},{"raw_affiliation_string":"Department of Computer Engineering, Arak Branch , Islamic Azad University , Arak , Iran","institution_ids":["https://openalex.org/I2801771032"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075982551"],"corresponding_institution_ids":["https://openalex.org/I2801771032"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.12432516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":"03","first_page":"329","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12288","display_name":"Optimization and Search Problems","score":0.989799976348877,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.7652568817138672},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7362011671066284},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6864466071128845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6013708710670471},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.5963869690895081},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.49257785081863403},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.47524547576904297},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4558474123477936},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4429122805595398},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4423191249370575},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4210665822029114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4131982624530792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3825477361679077},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24267083406448364},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.20415976643562317},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18212473392486572}],"concepts":[{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.7652568817138672},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7362011671066284},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6864466071128845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6013708710670471},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5963869690895081},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.49257785081863403},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.47524547576904297},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4558474123477936},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4429122805595398},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4423191249370575},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4210665822029114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4131982624530792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3825477361679077},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24267083406448364},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.20415976643562317},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18212473392486572},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905411350007x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411350007x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971782520","https://openalex.org/W1980076975","https://openalex.org/W2010334716","https://openalex.org/W2021438403","https://openalex.org/W2023745809","https://openalex.org/W2041944088","https://openalex.org/W2054305792","https://openalex.org/W2064300984","https://openalex.org/W2114045721","https://openalex.org/W2166812942","https://openalex.org/W3148734145","https://openalex.org/W4237954928"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W2381121915","https://openalex.org/W4380840098","https://openalex.org/W2589768050","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W1561849181","https://openalex.org/W2384589661"],"abstract_inverted_index":{"Min-degree":[0],"constrained":[1],"minimum":[2,16,175],"spanning":[3,18,171],"tree":[4,19,172],"(md-MST)":[5],"problem":[6,12,38,53,58,93,114,146],"is":[7,39,122,132,195],"an":[8,155],"NP-hard":[9],"combinatorial":[10],"optimization":[11],"seeking":[13],"for":[14,105],"the":[15,22,42,68,80,112,125,129,144,160,166,169,174,179,182,185,188,192,204,210,213,224,231,241,245],"weight":[17,126],"in":[20,54,65,94,115,228],"which":[21],"vertices":[23],"are":[24,73,201,219],"either":[25],"of":[26,82,168,181,187,212,223,230],"degree":[27,33],"one":[28],"(leaf)":[29],"or":[30],"at":[31],"least":[32],"d":[34],"\u2265":[35],"2.":[36],"md-MST":[37,57,92,113,145],"new":[40],"to":[41,79,111,149,191,208],"literature":[43],"and":[44,71,75,234],"very":[45],"few":[46],"studies":[47],"have":[48],"been":[49,88],"conducted":[50],"on":[51,90,165,203],"this":[52,119],"deterministic":[55],"graph.":[56,96,117],"has":[59,87],"several":[60],"appealing":[61],"real-world":[62],"applications.":[63],"Though":[64],"realistic":[66],"applications":[67],"graph":[69,130,206],"conditions":[70],"parameters":[72],"stochastic":[74,95,116,205],"vary":[76],"with":[77,128,135,173,221],"time,":[78],"best":[81],"our":[83],"knowledge":[84],"no":[85],"work":[86],"done":[89],"solving":[91],"This":[97,141],"paper":[98],"proposes":[99],"a":[100,107,136],"decentralized":[101],"learning":[102],"automata-based":[103],"algorithm":[104,153,190],"finding":[106],"near":[108],"optimal":[109,193],"solution":[110,194,235],"In":[118],"work,":[120],"it":[121],"assumed":[123],"that":[124,240],"associated":[127],"edge":[131],"random":[133],"variable":[134],"priori":[137],"unknown":[138],"probability":[139],"distribution.":[140],"assumption":[142],"makes":[143],"incredibly":[147],"harder":[148],"solve.":[150],"The":[151,216],"proposed":[152,189,214,242],"exploits":[154],"intelligent":[156],"sampling":[157,226,232,247],"technique":[158],"avoiding":[159],"unnecessary":[161],"samples":[162],"by":[163],"focusing":[164],"edges":[167],"min-degree":[170],"expected":[176],"weight.":[177],"On":[178],"basis":[180],"Martingale":[183],"theorem,":[184],"convergence":[186],"theoretically":[196],"proven.":[197],"Extensive":[198],"simulation":[199],"experiments":[200,238],"performed":[202],"instances":[207],"show":[209,239],"performance":[211],"algorithm.":[215],"obtained":[217],"results":[218],"compared":[220],"those":[222],"standard":[225,246],"method":[227,243],"terms":[229],"rate":[233],"optimality.":[236],"Simulation":[237],"outperforms":[244],"method.":[248]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}