{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:09:27Z","timestamp":1778252967698,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239314","type":"print"},{"value":"9783540304999","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30499-9_32","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T09:41:13Z","timestamp":1277890873000},"page":"218-223","source":"Crossref","is-referenced-by-count":1,"title":["Multiobjective Genetic Search for Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. K.","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. P.","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M.V. Marathe","year":"1998","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Bicriteria Network Design Problems. J. Algorithms\u00a028, 142\u2013171 (1998)","journal-title":"J. Algorithms"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00453-001-0038-2","volume":"31","author":"R. Ravi","year":"2001","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Approximation Algorithms for Degree-Constrained Minimum-Cost Network Design Problems. Algorithmica\u00a031, 58\u201378 (2001)","journal-title":"Algorithmica"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0167-8191(95)00010-0","volume":"22","author":"N. Boldon","year":"1996","unstructured":"Boldon, N., Deo, N., Kumar, N.: Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. Parallel Computing\u00a022, 369\u2013382 (1996)","journal-title":"Parallel Computing"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-46521-9_2","volume-title":"Algorithms and Complexity","author":"N. Deo","year":"2000","unstructured":"Deo, N., Abdalla, A.: Computing a diameter-constrained minimum spanning tree in parallel. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol.\u00a01767, pp. 17\u201331. Springer, Heidelberg (2000)"},{"key":"32_CR5","unstructured":"Deo, N., Micikevicius, P.: Comparison of Pr\u00fcfer-like Codes for Labeled Trees. In: Proc. 32nd South-Eastern Int. Conf. Combinatorics, Graph Theory and Computing (2001)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Raidl, G.R., Julstrom, B.A.: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. In: Proc. 18th ACM Symposium on Applied Computing (SAC 2003), pp. 747\u2013752 (2003)","DOI":"10.1145\/952532.952678"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"B.A. Julstrom","year":"2003","unstructured":"Julstrom, B.A., Raidl, G.R.: Edge Sets: An Effective Evolutionary Coding of Spanning Trees. IEEE Trans. Evolutionary Computation\u00a07, 225\u2013239 (2003)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J.D. Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem. IEEE Trans. Evolutionary Computation\u00a04, 125\u2013133 (2000)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Corne, D.W.: A Comparison of Encodings and Algorithms forMultiobjective Minimum Spanning Tree Problems. In: Proc. 2001 Congress on Evolutionary Computation (CEC-2001), vol.\u00a01, pp. 544\u2013551 (2001)","DOI":"10.1109\/CEC.2001.934439"},{"key":"32_CR10","volume-title":"Multiobjective Optimization Using Evolutionary Algorithms","author":"K. Deb","year":"2001","unstructured":"Deb, K.: Multiobjective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1162\/106365602760234117","volume":"10","author":"R. Kumar","year":"2002","unstructured":"Kumar, R., Rockett, P.I.: Improved Sampling of the Pareto-front in Multiobjective Genetic Optimization by Steady-State Evolution: A Pareto Converging Genetic Algorithm. Evolutionary Computation\u00a010, 283\u2013314 (2002)","journal-title":"Evolutionary Computation"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M. Laumanns","year":"2002","unstructured":"Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining Convergence and Diversity in Evolutionary Multiobjective Optimization. Evolutionary Computation\u00a010, 263\u2013282 (2002)","journal-title":"Evolutionary Computation"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","volume":"114","author":"G. Zohu","year":"1999","unstructured":"Zohu, G., Gen, M.: Genetic Algorithm Approach on Multi-CriteriaMinimum Spanning Tree Problem. European J. Operations Research\u00a0114, 141\u2013152 (1999)","journal-title":"European J. Operations Research"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30499-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:43Z","timestamp":1778249443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30499-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239314","9783540304999"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30499-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}