{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:05Z","timestamp":1750308005422,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144000","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"11-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["An ant-based algorithm for finding degree-constrained minimum spanning tree"],"prefix":"10.1145","author":[{"given":"Thang N.","family":"Bui","sequence":"first","affiliation":[{"name":"The Pennsylvania State University at Harrisburg, Middletown, PA"}]},{"given":"Catherine M.","family":"Zrncic","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University at Harrisburg, Middletown, PA"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(95)00010-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.508322"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Bui T. N.\n       and \n      J. R.\n      Rizzo Jr. \"\n  Finding Maximum Cliques with Distributed Ants \" GECCO\n  2004 Lecture Notes in Computer Science 3102 2004 pp. \n  24\n  --\n  35\n  .  Bui T. N. and J. R. Rizzo Jr. \"Finding Maximum Cliques with Distributed Ants \" GECCO 2004 Lecture Notes in Computer Science 3102 2004 pp. 24--35.","DOI":"10.1007\/978-3-540-24854-5_3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Bui T. N.\n       and \n      G.\n      Sundarraj \"\n  Ant System for the k-Cardinality Tree Problem \" GECCO\n  2004 Lecture Notes in Computer Science 3102 2004 pp. \n  36\n  --\n  47\n  .  Bui T. N. and G. Sundarraj \"Ant System for the k-Cardinality Tree Problem \" GECCO 2004 Lecture Notes in Computer Science 3102 2004 pp. 36--47.","DOI":"10.1007\/978-3-540-24854-5_4"},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"Cormen , T. H. , C. E. Leiserson , R. L. Rivest , and C. Stein , Introduction to Algorithms , Second Edition, MIT Press , 2001 . Cormen, T. H., C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Second Edition, MIT Press, 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Delbem C. B. A.\n      de Carvalho C. A.\n      Policastro A. K. O.\n      Pinto K.\n      Honda and \n      A. C.\n      Garcia \"\n  Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design \" GECCO\n  2004 Lecture Notes in Computer Science 3102 2004 pp. \n  678\n  --\n  687\n  .  Delbem C. B. A. de Carvalho C. A. Policastro A. K. O. Pinto K. Honda and A. C. Garcia \"Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design \" GECCO 2004 Lecture Notes in Computer Science 3102 2004 pp. 678--687.","DOI":"10.1007\/978-3-540-24854-5_70"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"Garey , M. R. and D. S. Johnson , Computers and Intractability, a Guide to the Theory of NP-Completeness , W. H. Freeman and Co. , 1979 . Garey, M. R. and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, W. H. Freeman and Co., 1979."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.850653"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011977126230"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90022-2"},{"key":"e_1_3_2_1_13_1","first-page":"104","volume-title":"IEEE CEC","author":"Raidl G. R.","year":"2000","unstructured":"Raidl , G. R. , \"An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem,\" Proc . IEEE CEC , 2000 , pp. 104 -- 111 . Raidl, G. R., \"An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem,\" Proc. IEEE CEC, 2000, pp. 104--111."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/335603.335888"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.807275"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167209"},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"A Hybrid ACO Algorithm for the Capacitated Minimum Spanning Tree Problem","author":"Reimann M.","year":"2004","unstructured":"Reimann , M. and M. Laumanns , \" A Hybrid ACO Algorithm for the Capacitated Minimum Spanning Tree Problem ,\" Hybrid Metaheurustucs , 2004 , pp. 1 -- 10 . Reimann, M. and M. Laumanns, \"A Hybrid ACO Algorithm for the Capacitated Minimum Spanning Tree Problem,\" Hybrid Metaheurustucs, 2004, pp. 1--10.","journal-title":"Hybrid Metaheurustucs"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(85)90032-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/0952813021000032699"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_44"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/348599.348603"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/545151.545152"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90169-0"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F"}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144000","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:29Z","timestamp":1750259189000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":24,"alternative-id":["10.1145\/1143997.1144000","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144000","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}