{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:57:09Z","timestamp":1725562629969},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148330"},{"type":"electronic","value":"9783642148347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14834-7_22","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T16:50:55Z","timestamp":1281459055000},"page":"229-240","source":"Crossref","is-referenced-by-count":2,"title":["Assessing the Performance of Bi-objective MST for Euclidean and Non-Euclidean Instances"],"prefix":"10.1007","author":[{"given":"Soma","family":"Saha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Aslam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Computers and Interactibility: A guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Interactibility: A guide to the theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"22_CR2","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)"},{"issue":"1.1","key":"22_CR3","first-page":"1","volume":"14","author":"B.A. Julstrom","year":"2009","unstructured":"Julstrom, B.A.: Greedy heuristics for the bounded diameter minimum spanning tree problem. Journal of Experimental Algorithmics (JEA)\u00a014, 1.1:1\u20131.1:14 (2009)","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"22_CR4","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: 18th ACM Symposium on Applied Computing (SAC 2003), pp. 747\u2013752 (2003)","DOI":"10.1145\/952532.952678"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Nghia, N.D., Binh, H.T.T.: Heuristic algorithms for solving bounded diameter minimum spanning tree problem and its application to genetic algorithm development. Advances in Greedy Algorithms, 586 (November 2008)","DOI":"10.1109\/RIVF.2007.369143"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45110-2_134","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"B.A. Julstrom","year":"2003","unstructured":"Julstrom, B.A., Raidl, G.R.: A permutation coded evolutionary for the bounded diameter minimum spanning tree problem. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 2\u20137. Springer, Heidelberg (2003)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Gruber, M., Hemert, J.V., Raidl, G.R.: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a vns, ea, and aco. In: GECCO 2006 (July 2006)","DOI":"10.1145\/1143997.1144185"},{"key":"22_CR8","volume-title":"New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem","author":"H.T.T. Binh","year":"2009","unstructured":"Binh, H.T.T., Hoai, N.X., Mckay, R.I., Nghia, N.D.: New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem. ACM, New York (2009)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s00500-006-0142-y","volume":"11","author":"A. Singh","year":"2007","unstructured":"Singh, A., Gupta, A.K.: Impoved heuristics for the bounded diameter minimum spanning tree problem. Journal Soft Computing\u00a011, 911\u2013921 (July 2007)","journal-title":"Journal Soft Computing"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kumar, R., Bal, B.K., Rockett, P.I.: Multiobjective genetic programming approach to evolving heuristics for the bounded diameter minimum spanning tree problem. In: GECCO 2009 (2009)","DOI":"10.1145\/1569901.1569945"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1145\/1276958.1277394","volume-title":"GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation","author":"R. Kumar","year":"2007","unstructured":"Kumar, R., Singh, P.K.: On quality performance of heuristic and evolutionary algorithms for biobjective minimum spanning trees. In: GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, p. 2259. ACM Press, New York (2007)"},{"key":"22_CR12","unstructured":"Abdalla, A.: Computing a Diameter-constraint Minimum Spanning Tree. PhD thesis, The School of Electrical Engineering and Computer Science, University of Central Florida, Florida (2001)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/978-3-642-04772-5_86","volume-title":"Computer Aided Systems Theory - EUROCAST 2009","author":"M. Gruber","year":"2009","unstructured":"Gruber, M., Raidl, G.R.: Solving the euclidean bounded diameter minimum spanning tree problem by clustering based (meta) heuristics. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) Computer Aided Systems Theory - EUROCAST 2009. LNCS, vol.\u00a05717, pp. 665\u2013672. Springer, Heidelberg (2009)"}],"container-title":["Communications in Computer and Information Science","Contemporary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14834-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T18:56:17Z","timestamp":1685732177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14834-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642148330","9783642148347"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14834-7_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}