{"id":"https://openalex.org/W2043113141","doi":"https://doi.org/10.1145/1143997.1144000","title":"An ant-based algorithm for finding degree-constrained minimum spanning tree","display_name":"An ant-based algorithm for finding degree-constrained minimum spanning tree","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W2043113141","doi":"https://doi.org/10.1145/1143997.1144000","mag":"2043113141"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144000","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","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/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":["The Pennsylvania State University at Harrisburg, Middletown, PA"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University at Harrisburg, Middletown, PA","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":["The Pennsylvania State University at Harrisburg, Middletown, PA"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University at Harrisburg, Middletown, PA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100829364"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":3.0647,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.90919653,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9958999752998352,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9958999752998352,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9948999881744385,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8145831823348999},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7937624454498291},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.791435956954956},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6655135154724121},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6651246547698975},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6317074298858643},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.6186845898628235},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6114138960838318},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5898596048355103},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5732221007347107},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5491724610328674},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5178149342536926},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.513773500919342},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.49160677194595337},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4859834611415863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44785526394844055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4239656925201416},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4118487536907196},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.37238866090774536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3671468496322632},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3550074100494385},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.23132702708244324},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14994457364082336}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8145831823348999},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7937624454498291},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.791435956954956},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6655135154724121},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6651246547698975},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6317074298858643},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.6186845898628235},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6114138960838318},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5898596048355103},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5732221007347107},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5491724610328674},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5178149342536926},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.513773500919342},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.49160677194595337},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4859834611415863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44785526394844055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4239656925201416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4118487536907196},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.37238866090774536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3671468496322632},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3550074100494385},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.23132702708244324},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14994457364082336},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1143997.1144000","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.335.1799","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.1799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.york.ac.uk/rts/docs/GECCO_2006/docs/p11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1506053358","https://openalex.org/W1569312529","https://openalex.org/W1576264677","https://openalex.org/W1607435875","https://openalex.org/W1801849579","https://openalex.org/W1948148225","https://openalex.org/W1963802054","https://openalex.org/W1967977254","https://openalex.org/W1971782520","https://openalex.org/W1978215445","https://openalex.org/W1995670816","https://openalex.org/W2002764437","https://openalex.org/W2004711524","https://openalex.org/W2011039300","https://openalex.org/W2014340938","https://openalex.org/W2033983963","https://openalex.org/W2098694839","https://openalex.org/W2107941094","https://openalex.org/W2118051273","https://openalex.org/W2142146559","https://openalex.org/W2161880126","https://openalex.org/W2162974503","https://openalex.org/W2169647400","https://openalex.org/W3004540582","https://openalex.org/W3145128584","https://openalex.org/W3183881215","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W2518240130","https://openalex.org/W2130375301","https://openalex.org/W2281826919","https://openalex.org/W3081212354","https://openalex.org/W2353822696","https://openalex.org/W1576317141","https://openalex.org/W2361573941"],"abstract_inverted_index":{"A":[0],"spanning":[1,22,30,58,74],"tree":[2,12,31,75],"of":[3,26,32,67,95],"a":[4,20,65,72,93],"graph":[5],"such":[6],"that":[7,83],"each":[8],"vertex":[9],"in":[10,35],"the":[11,28,84],"has":[13],"degree":[14],"at":[15],"most":[16],"d":[17],"is":[18],"called":[19],"degree-constrained":[21,29,57,73],"tree.":[23],"The":[24],"problem":[25,97],"finding":[27,54],"minimum":[33],"cost":[34,56],"an":[36,50],"edge":[37],"weighted":[38],"graphis":[39],"well":[40,88],"known":[41],"to":[42,63],"be":[43,77],"NP-hard.":[44],"In":[45],"this":[46],"paper":[47],"we":[48],"give":[49],"Ant-Based":[51],"algorithm":[52,85],"for":[53],"low":[55],"trees.":[59],"Ants":[60],"are":[61],"used":[62],"identify":[64],"set":[66,94],"candidate":[68],"edges":[69],"from":[70],"which":[71],"can":[76],"constructed.":[78],"Extensive":[79],"experimental":[80],"results":[81],"show":[82],"performs":[86],"very":[87],"against":[89],"other":[90],"algorithms":[91],"on":[92],"572":[96],"instances.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}