{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:55:25Z","timestamp":1760608525146,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"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":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389279","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"969-976","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The node-depth encoding"],"prefix":"10.1145","author":[{"given":"Telma W.","family":"de Lima","sequence":"first","affiliation":[{"name":"University of Sao Paulo, Sao Carlos, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[{"name":"University of Mainz, Mainz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre C.B.","family":"Delbem","sequence":"additional","affiliation":[{"name":"University of Sao Paulo, Sao Carlos, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207160211289"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/326619.326733"},{"key":"e_1_3_2_1_3_1","unstructured":"N. Achuthan L. Caccetta P. Caccetta and G. J.F. Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: techniques and applications.  N. Achuthan L. Caccetta P. Caccetta and G. J.F. Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: techniques and applications."},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2000","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , 2 nd edition. MIT Press, McGraw- Hill Book Company , 2000 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, 2nd edition. MIT Press, McGraw-Hill Book Company, 2000.","edition":"2"},{"key":"e_1_3_2_1_5_1","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"Deb K.","year":"2001","unstructured":"K. Deb . Multi-Objective Optimization Using Evolutionary Algorithms . John Wiley & amp; Sons, Inc., New York, NY, USA, 2001 . K. Deb. Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons, Inc., New York, NY, USA, 2001."},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1007\/978-3-540-24854-5_70","volume-title":"K. Deb and et al.","author":"Delbem A.","year":"2004","unstructured":"A. Delbem , A. de Carvalho , C. A. Policastro , A. K. Pinto , K. Honda , and A. C. Garcia . Node-depth encoding for evolutionary algorithms applied to network design . In K. Deb and et al. , editors, Genetic and Evolutionary Computation -- GECCO- 2004 , Part I, Lecture Notes in Computer Science , pages 678 -- 687 , Seattle, WA, USA, 26-30 June 2004. Springer-Verlag . A. Delbem, A. de Carvalho, C. A. Policastro, A. K. Pinto, K. Honda, and A. C. Garcia. Node-depth encoding for evolutionary algorithms applied to network design. In K. Deb and et al., editors, Genetic and Evolutionary Computation -- GECCO-2004, Part I, Lecture Notes in Computer Science, pages 678--687, Seattle, WA, USA, 26-30 June 2004. Springer-Verlag."},{"key":"e_1_3_2_1_7_1","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability ; A Guide to the Theory of NP-Completeness. W. H. Freeman & amp; Co., New York, NY, USA, 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144185"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_3_2_1_10_1","first-page":"1272","volume-title":"K. Deb and et al.","author":"Julstrom B. A.","year":"2004","unstructured":"B. A. Julstrom . Encoding bounded-diameter spanning trees with permutations and with random keys . In K. Deb and et al. , editors, Genetic and Evolutionary Computation -- GECCO- 2004 , Part I, volume 3102 , pages 1272 -- 1281 , Seattle, WA, USA, 26-30 June 2004. Springer-Verlag . B. A. Julstrom. Encoding bounded-diameter spanning trees with permutations and with random keys. In K. Deb and et al., editors, Genetic and Evolutionary Computation -- GECCO-2004, Part I, volume 3102, pages 1272--1281, Seattle, WA, USA, 26-30 June 2004. Springer-Verlag."},{"key":"e_1_3_2_1_11_1","first-page":"2","volume-title":"GECCO 2003: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference","author":"Julstrom B. A.","year":"2003","unstructured":"B. A. Julstrom and G. R. Raidl . A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In A. M. Barry, editor , GECCO 2003: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference , pages 2 -- 7 , Chigaco , 11 July 2003 . AAAI. B. A. Julstrom and G. R. Raidl. A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In A. M. Barry, editor, GECCO 2003: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pages 2--7, Chigaco, 11 July 2003. AAAI."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.850653"},{"key":"e_1_3_2_1_14_1","volume-title":"University of California","author":"Picciotto S.","year":"1999","unstructured":"S. Picciotto . How to Encode a Tree. PhD thesis , University of California , 1999 . S. Picciotto. How to Encode a Tree. PhD thesis, University of California, 1999."},{"key":"e_1_3_2_1_15_1","volume-title":"Arch. Math. Phys.","author":"Pr\u00fcfer H.","year":"1918","unstructured":"H. Pr\u00fcfer . Neuer beweis eines satzes uber permutationen . Arch. Math. Phys. , 1918 . H. Pr\u00fcfer. Neuer beweis eines satzes uber permutationen. Arch. Math. Phys., 1918."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666886"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.807275"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952678"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)E0014-K"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1203065"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602317301781"},{"key":"e_1_3_2_1_22_1","volume-title":"On the bias and performance of the edge-set encoding","author":"Rothlauf F.","year":"2005","unstructured":"F. Rothlauf and C. Tzschoppe . On the bias and performance of the edge-set encoding , 2005 . F. Rothlauf and C. Tzschoppe. On the bias and performance of the edge-set encoding, 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-006-0142-y"}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Atlanta GA USA","acronym":"GECCO08"},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389279","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:41Z","timestamp":1750255061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389279"}},"subtitle":["analysis and application to the bounded-diameter minimum spanning tree problem"],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":22,"alternative-id":["10.1145\/1389095.1389279","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389279","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}