{"id":"https://openalex.org/W2093102835","doi":"https://doi.org/10.1109/tevc.2011.2125971","title":"An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem","display_name":"An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem","publication_year":2011,"publication_date":"2011-06-28","ids":{"openalex":"https://openalex.org/W2093102835","doi":"https://doi.org/10.1109/tevc.2011.2125971","mag":"2093102835"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2011.2125971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2011.2125971","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","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/A5100829364","display_name":"Thang Nguyen Bui","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thang N. Bui","raw_affiliation_strings":["Department of Mathematics and Computer Science, Pennsylvania State University, Middletown, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Pennsylvania State University, Middletown, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065285943","display_name":"Xianghua Deng","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]},{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xianghua Deng","raw_affiliation_strings":["Google, Inc., Mountain View, CA, USA","Pennsylvania State University, Middletown, PA, USA"],"affiliations":[{"raw_affiliation_string":"Google, Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Pennsylvania State University, Middletown, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027531239","display_name":"Catherine M. Zrncic","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Catherine M. Zrncic","raw_affiliation_strings":["Department of Mathematics and Computer Science, Pennsylvania State University, Middletown, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Pennsylvania State University, Middletown, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100829364"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":2.1197,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.88259514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":"2","first_page":"266","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.998199999332428,"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.998199999332428,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8128764629364014},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7730626463890076},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6394280195236206},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.5798337459564209},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5547760128974915},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5284820795059204},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5207222104072571},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.49572837352752686},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4926159977912903},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.4846346974372864},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.47209471464157104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4664943218231201},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.46560484170913696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4589911103248596},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4563794732093811},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4171571731567383},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4164707660675049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4136182367801666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3890862762928009},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35722213983535767}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8128764629364014},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7730626463890076},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6394280195236206},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5798337459564209},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5547760128974915},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5284820795059204},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5207222104072571},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.49572837352752686},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4926159977912903},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4846346974372864},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.47209471464157104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4664943218231201},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.46560484170913696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4589911103248596},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4563794732093811},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4171571731567383},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4164707660675049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4136182367801666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3890862762928009},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35722213983535767},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tevc.2011.2125971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2011.2125971","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1527884540","https://openalex.org/W1560173509","https://openalex.org/W1801849579","https://openalex.org/W1948148225","https://openalex.org/W1967977254","https://openalex.org/W1971782520","https://openalex.org/W1995670816","https://openalex.org/W2004711524","https://openalex.org/W2011039300","https://openalex.org/W2014340938","https://openalex.org/W2033983963","https://openalex.org/W2040134365","https://openalex.org/W2043113141","https://openalex.org/W2054305792","https://openalex.org/W2095595785","https://openalex.org/W2098694839","https://openalex.org/W2107941094","https://openalex.org/W2118051273","https://openalex.org/W2119799975","https://openalex.org/W2126646301","https://openalex.org/W2126785038","https://openalex.org/W2131722136","https://openalex.org/W2142146559","https://openalex.org/W2161880126","https://openalex.org/W2162974503","https://openalex.org/W2169647400","https://openalex.org/W2171211995","https://openalex.org/W2752885492","https://openalex.org/W4213318664","https://openalex.org/W6674848555","https://openalex.org/W6683679523"],"related_works":["https://openalex.org/W2390742649","https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W2099915933","https://openalex.org/W88291963","https://openalex.org/W2014991506","https://openalex.org/W2589768050","https://openalex.org/W2048177396"],"abstract_inverted_index":{"The":[0,44,66],"degree-constrained":[1,62],"minimum":[2,13],"spanning":[3,15,29,63],"tree":[4,16,30],"(DCMST)":[5],"problem":[6,9,46,105],"is":[7,47,88],"the":[8,12,28,75,99],"of":[10,71,81],"finding":[11],"cost":[14,61],"in":[17,27],"an":[18,55],"edge":[19],"weighted":[20],"complete":[21],"graph":[22,76],"such":[23],"that":[24],"each":[25],"vertex":[26],"has":[31],"degree":[32],"\u2264":[33],"<i":[34,39],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[35,40],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">d</i>":[36,41],"for":[37],"some":[38],"\u2265":[42],"2.":[43],"DCMST":[45],"known":[48],"to":[49,58,96],"be":[50],"NP-hard.":[51],"This":[52],"paper":[53],"presents":[54],"ant-based":[56],"algorithm":[57,67],"find":[59],"low":[60],"trees":[64],"(DCST).":[65],"employs":[68],"a":[69,79,86],"set":[70,80],"ants":[72],"which":[73,85],"traverse":[74],"and":[77],"identify":[78],"candidate":[82],"edges,":[83],"from":[84],"DCST":[87],"constructed.":[89],"Local":[90],"optimization":[91],"algorithms":[92],"are":[93],"then":[94],"used":[95],"further":[97],"improve":[98],"DCST.":[100],"Extensive":[101],"experiments":[102],"using":[103],"612":[104],"instances":[106],"show":[107],"many":[108],"improvements":[109],"over":[110],"existing":[111],"algorithms.":[112]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}