{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:44:38Z","timestamp":1758271478456,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"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":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068108","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"585-590","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem"],"prefix":"10.1145","author":[{"given":"Bryant A.","family":"Julstrom","sequence":"first","affiliation":[{"name":"St. Cloud State University, St. Cloud, MN"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Data Structures and Algorithms","author":"Aho Alfred V.","year":"1983","unstructured":"Alfred V. Aho , John~ E. Hopcroft , and Jeffrey D. Ullman . Data Structures and Algorithms . Addison-Wesley , Reading, MA , 1983 . Alfred V. Aho, John~E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1990.166"},{"key":"e_1_3_2_1_3_1","first-page":"361","volume-title":"Proceedings of the Regional International Teletraffic Conference","author":"Berry L. T. M.","year":"1995","unstructured":"L. T. M. Berry , B. A. Murtagh , S. J. Sugden , and G. B. McMahon . Application of a genetic-based algorithm for optimal design of tree-structured communication networks . In Proceedings of the Regional International Teletraffic Conference , pages 361 -- 369 , Pretoria, South Africa , 1995 . L. T. M. Berry, B. A. Murtagh, S. J. Sugden, and G. B. McMahon. Application of a genetic-based algorithm for optimal design of tree-structured communication networks. In Proceedings of the Regional International Teletraffic Conference, pages 361--369, Pretoria, South Africa, 1995."},{"key":"e_1_3_2_1_4_1","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley A.","year":"1889","unstructured":"A. Cayley . A theorem on trees . Quarterly Journal of Mathematics , 23 : 376 -- 378 , 1889 . A. Cayley. A theorem on trees. Quarterly Journal of Mathematics, 23:376--378, 1889.","journal-title":"Quarterly Journal of Mathematics"},{"key":"e_1_3_2_1_5_1","volume-title":"The Macmillan Company","author":"Even Shimon","year":"1973","unstructured":"Shimon Even . Algorithmic Combinatorics . The Macmillan Company , New York , 1973 . Shimon Even. Algorithmic Combinatorics. The Macmillan Company, New York, 1973."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10022"},{"key":"e_1_3_2_1_8_1","first-page":"343","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO--2001","author":"Gottlieb Jens","year":"2001","unstructured":"Jens Gottlieb , Bryant~ A. Julstrom , G\u00fcnther R. Raidl , and Franz Rothlauf . Pr\u00fcfer numbers : A poor representation of spanning trees for evolutionary search. In L. Spector et al., editors , Proceedings of the Genetic and Evolutionary Computation Conference, GECCO--2001 , pages 343 -- 350 , San Francisco, CA , 2001 . Morgan Kaufmann. July 7--11, San Francisco, CA. Jens Gottlieb, Bryant~A. Julstrom, G\u00fcnther R. Raidl, and Franz Rothlauf. Pr\u00fcfer numbers: A poor representation of spanning trees for evolutionary search. In L. Spector et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO--2001, pages 343--350, San Francisco, CA, 2001. Morgan Kaufmann. July 7--11, San Francisco, CA."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/356458.356463"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080402"},{"key":"e_1_3_2_1_12_1","first-page":"256","volume-title":"2001 Genetic and Evolutionary Computation Conference Workshop Program","author":"Julstrom Bryant A.","year":"2001","unstructured":"Bryant A. Julstrom . The Blob Code: A better string coding of spanning trees for evolutionary search. In Annie S. Wu, editor , 2001 Genetic and Evolutionary Computation Conference Workshop Program , pages 256 -- 261 , San Francisco, CA , 2001 . July 7. Bryant A. Julstrom. The Blob Code: A better string coding of spanning trees for evolutionary search. In Annie S. Wu, editor, 2001 Genetic and Evolutionary Computation Conference Workshop Program, pages 256--261, San Francisco, CA, 2001. July 7."},{"key":"e_1_3_2_1_13_1","first-page":"934","volume-title":"Proceedings of the International Conference on Artificial Intelligence","author":"Julstrom Bryant A.","year":"2002","unstructured":"Bryant A. Julstrom . A genetic algorithm and two hill-climbers for the minimum routing cost spanning tree problem. In H. R. Arabnia and Youngsong Mun, editors , Proceedings of the International Conference on Artificial Intelligence , volume III , pages 934 -- 940 . CSREA Press , 2002 . Bryant A. Julstrom. A genetic algorithm and two hill-climbers for the minimum routing cost spanning tree problem. In H. R. Arabnia and Youngsong Mun, editors, Proceedings of the International Conference on Artificial Intelligence, volume III, pages 934--940. CSREA Press, 2002."},{"key":"e_1_3_2_1_14_1","first-page":"11","volume-title":"Proceedings of EvoWorkshops 2001","author":"Li Yu","year":"2001","unstructured":"Yu Li . An effective implementation of a direct spanning tree representation in GAs. In Egbert J. W. Boers et al., editors , Proceedings of EvoWorkshops 2001 , pages 11 -- 19 , Berlin , 2001 . Springer-Verlag. Yu Li. An effective implementation of a direct spanning tree representation in GAs. In Egbert J. W. Boers et al., editors, Proceedings of EvoWorkshops 2001, pages 11--19, Berlin, 2001. Springer-Verlag."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","first-page":"162","volume-title":"Cyril Fonlupt et al.","author":"Li Yu","year":"1829","unstructured":"Yu Li and Youcef Bouchebaba . A new genetic algorithm for the optimal communications spanning tree problem . In Cyril Fonlupt et al. , editors, Artificial Evolution: 4th European Conference, number 1829 in Lecture Notes in Computer Science , pages 162 -- 173 , Berlin, 1999. Springer-Verlag . Yu Li and Youcef Bouchebaba. A new genetic algorithm for the optimal communications spanning tree problem. In Cyril Fonlupt et al., editors, Artificial Evolution: 4th European Conference, number 1829 in Lecture Notes in Computer Science, pages 162--173, Berlin, 1999. Springer-Verlag."},{"key":"e_1_3_2_1_16_1","first-page":"379","volume-title":"Proceedings of the First IEEE Conference on Evolutionary Computation","volume":"1","author":"Charles","year":"1994","unstructured":"Charles C. Palmer and Aaron Kershenbaum. Representing trees in genetic algorithms . In Proceedings of the First IEEE Conference on Evolutionary Computation , volume 1 , pages 379 -- 384 , June 1994 . Charles C. Palmer and Aaron Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, volume 1, pages 379--384, June 1994."},{"key":"e_1_3_2_1_18_1","first-page":"142","article-title":"Neuer beweis eines satzes \u00fcber permutationen","volume":"27","author":"Pr\u00fcfer H.","year":"1918","unstructured":"H. Pr\u00fcfer . Neuer beweis eines satzes \u00fcber permutationen . Archives of Mathematical Physics , 27 : 142 -- 144 , 1918 . H. Pr\u00fcfer. Neuer beweis eines satzes \u00fcber permutationen. Archives of Mathematical Physics, 27:142--144, 1918.","journal-title":"Archives of Mathematical Physics"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.807275"},{"key":"e_1_3_2_1_20_1","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88094-0","volume-title":"Representations for Genetic and Evolutionary Algorithms","author":"Rothlauf Franz","year":"2002","unstructured":"Franz Rothlauf . Representations for Genetic and Evolutionary Algorithms , volume 104 of Studies in Fuzziness and Soft Computing . Physica-Verlag , Heidelberg , 2002 . Franz Rothlauf. Representations for Genetic and Evolutionary Algorithms, volume 104 of Studies in Fuzziness and Soft Computing. Physica-Verlag, Heidelberg, 2002."},{"key":"e_1_3_2_1_21_1","first-page":"238","volume-title":"Scott Brave and Annie S. Wu","author":"Rothlauf Franz","year":"1999","unstructured":"Franz Rothlauf and David Goldberg . Tree network design with genetic algorithms -- An investigation in the locality of the Pruefernumber encoding . In Scott Brave and Annie S. Wu , editors, Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference , pages 238 -- 243 , 1999. Franz Rothlauf and David Goldberg. Tree network design with genetic algorithms -- An investigation in the locality of the Pruefernumber encoding. In Scott Brave and Annie S. Wu, editors, Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, pages 238--243, 1999."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732253X"}],"event":{"name":"GECCO05: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Washington DC USA","acronym":"GECCO05"},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:59Z","timestamp":1750262879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":21,"alternative-id":["10.1145\/1068009.1068108","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068108","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}