{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T04:43:20Z","timestamp":1745124200737},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678465"},{"type":"electronic","value":"9783540449089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721187_12","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T17:56:59Z","timestamp":1167415019000},"page":"162-173","source":"Crossref","is-referenced-by-count":9,"title":["A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Yu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youcef","family":"Bouchebaba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"470","volume-title":"Proc. 6th Int. Conf. on Genetic Algorithms (ICGA 1995)","author":"F.N. Abuali","year":"1995","unstructured":"Abuali, F.N., Wainwright, R.L., Schoenefeld, D.A.: Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning trees problem. In: Proc. 6th Int. Conf. on Genetic Algorithms (ICGA 1995), pp. 470\u2013477. University of Pittsburgh, USA (1995)"},{"key":"12_CR2","unstructured":"Berry, L., Mutagh, B., Sugden, S., McMahon, G.: Application of genetic- based algorithm for optimal design of tree-structured communication networks. In: Proceedings of the Regional Teletraffic Engineering Conference of the International Teletraffic Congress, South Africa, pp. 361\u2013370 (1995)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Crecenzi, P., Kann, V.: A compendium of NP optimization problems. (August 1998), Available online at http:\/\/www.nada.kth.se\/theory\/compendium\/","DOI":"10.1007\/3-540-63248-4_10"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230260403","volume":"26","author":"H. Esbensen","year":"1995","unstructured":"Esbensen, H.: Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm. Networks\u00a026, 173\u2013185 (1995)","journal-title":"Networks"},{"key":"12_CR5","volume-title":"Algorithmic graph theory","author":"A. Gibbons","year":"1985","unstructured":"Gibbons, A.: Algorithmic graph theory. Cambridge University Press, New York (1985)"},{"key":"12_CR6","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Hu, T.C.: Optimum communication spanning trees. SIAM J. on Computing, 188\u2013195 (1974)","DOI":"10.1137\/0203015"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Rinnooy Kan, A.H.G.: The complexity of the network design problem. Networks\u00a08, 279\u2013285 (1978)","journal-title":"Networks"},{"key":"12_CR9","first-page":"474","volume-title":"Proc. 15th Int. Conf. on Genetic Algorithms, University of Illinois at Urbana-Champaign","author":"B.A. Julstrom","year":"1993","unstructured":"Julstrom, B.A.: A genetic algorithm for the rectilinear steiner problem. In: Forrest, S. (ed.) Proc. 15th Int. Conf. on Genetic Algorithms, University of Illinois at Urbana-Champaign, pp. 474\u2013479. Morgan Kaufmann, San Mateo (1993)"},{"key":"12_CR10","first-page":"268","volume-title":"Proceedings of the Seventh International Conference on Genetic Algorithms","author":"L. Kallel","year":"1997","unstructured":"Kallel, L., Schoenauer, M.: Alternative random initialization in genetic algorithms. In: Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 268\u2013275. Morgan Kaufmann, San Francisco (1997)"},{"key":"12_CR11","unstructured":"Palmer, C.C.: An approach to a problem in network design using genetic algorithms. PhD Thesis, Polytechnic University, Computer Science Department, Brookly, NewYork (1994)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/net.3230260305","volume":"26","author":"C.C. Palmer","year":"1995","unstructured":"Palmer, C.C., Kershenbaum, A.: An approach to a problem in network design using genetic algorithms. Networks\u00a026, 151\u2013163 (1995)","journal-title":"Networks"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/BFb0055092","volume-title":"Automata, Languages and Programming","author":"D. Peleg","year":"1998","unstructured":"Peleg, D., Reshef, E.: Deterministic polylog approximation for minimum communication spanning trees. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 670\u2013679. Springer, Heidelberg (1998)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0015249","volume-title":"Computer Science Today","author":"N.J. Radcliffe","year":"1995","unstructured":"Radcliffe, N.J., Surry, P.D.: Fundamental limitation on search algorithms: Evolutionary computing in perspective. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol.\u00a01000, pp. 275\u2013291. Springer, Heidelberg (1995)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Sinclair, M.C.: Minimum cost routing and wave-length allocation using a genetic-algorithm\/heuristic hybrid approach. In: Proc. 6th IEE Conf. on Telecommuni- cations, Edinburgh, UK, pp. 66\u201371 (1998)","DOI":"10.1049\/cp:19980014"},{"key":"12_CR16","volume-title":"Evolutionary Computing: AISB Workshop","author":"P.D. Surry","year":"1996","unstructured":"Surry, P.D., Radcliffe, N.J.: Inoculation to initialise evolutionary search. In: Fogarty, T. (ed.) Evolutionary Computing: AISB Workshop. Springer, Heidelberg (1996)"},{"key":"12_CR17","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute (1995)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721187_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:40:09Z","timestamp":1556019609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721187_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678465","9783540449089"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/10721187_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}