{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:15:37Z","timestamp":1743124537414,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226052"},{"type":"electronic","value":"9783642226069"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22606-9_20","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:36:44Z","timestamp":1312893404000},"page":"169-179","source":"Crossref","is-referenced-by-count":0,"title":["Property Analysis and Enhancement in Recombination Operator of Edge-Set Encoding for Spanning Tree"],"prefix":"10.1007","author":[{"given":"P. K.","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Vaid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"1350","volume-title":"IEEE INFOCOM 1993","author":"K. Bala","year":"1993","unstructured":"Bala, K., Petropoulos, K., Stern, T.E.: Multicasting in a Linear Lightwave Network. In: IEEE INFOCOM 1993, pp. 1350\u20131358. IEEE Computer Society Press, Los Alamitos (1993)"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A Tree-based Algorithm for Distributed Mutual Exclusion. ACM Transactions on Computer Systems\u00a07(1), 61\u201367 (1989)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0306-4379(91)90030-D","volume":"16","author":"A. Bookstein","year":"1996","unstructured":"Bookstein, A., Klein, S.T.: Compression of Correlated Bit-Vectors. Information Systems\u00a016(4), 387\u2013400 (1996)","journal-title":"Information Systems"},{"key":"20_CR4","unstructured":"Abdalla, A.: Computing a Diameter-constrained Minimum Spanning Tree. PhD Dissertation, The School of Electrical Engineering and Computer Science, University of Central Florida (2001)"},{"key":"20_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"20_CR6","unstructured":"Kortsarz, G., Peleg, D.: Approximating Shallow-light Trees. In: Symposium on Discrete Algorithms, pp. 103\u2013110 (1997)"},{"key":"20_CR7","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: ACM Symposium on Applied Computing, pp. 747\u2013752 (2003)","DOI":"10.1145\/952532.952678"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Raidl, G.R., Julstrom, B.A.: A Permutation Coded Evolutionary for the Bounded Diameter Minimum Spanning Tree Problem. In: Genetic and Evolutionary Computation Conference, pp. 2\u20137 (2003)","DOI":"10.1145\/952532.952678"},{"key":"20_CR9","first-page":"51","volume":"10","author":"N.R. Achuthan","year":"1994","unstructured":"Achuthan, N.R., Caccetta, L., Cacetta, P., Geelen, J.F.: Algorithms for the Minimum Weight Spanning Tree with Bounded Diameter Problem Optimization. Australian Journal of Combinatorics\u00a010, 51\u201357 (1994)","journal-title":"Australian Journal of Combinatorics"},{"key":"20_CR10","unstructured":"Gruber. M., Raidl, G.R.: A New 0-1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem. In: International Network Optimization Conference (2005)"},{"key":"20_CR11","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":"20_CR12","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. Prim","year":"1957","unstructured":"Prim, R.: Shortest Connection Networks and Some Generalization. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1007\/978-3-540-24854-5_122","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"B.A. Julstrom","year":"2004","unstructured":"Julstrom, B.A.: Encoding bounded-diameter spanning trees with permutations and with random keys. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03102, pp. 1272\u20131281. Springer, Heidelberg (2004)"},{"key":"20_CR14","unstructured":"Julstrom, B.A.: Greedy Heuristics for the Bounded-Diameter Minimum Spanning Tree Problem. ACM J. Exp. Algorithmics (2004)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Gruber, M., Raidl, G.R.: Variable Neighbourhood Search for the Bounded Diameter Minimum Spanning Tree Problem. In: 18th Mini Euro Conference on Variable Neighborhood Search, Spain (2006)","DOI":"10.1145\/1143997.1144185"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Gruber, M., Hemert, J., Raidl, G.R.: Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA and ACO. In: Genetic and Evolutionary Computational Conference, pp. 1187\u20131194 (2006)","DOI":"10.1145\/1143997.1144185"},{"key":"20_CR17","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.: An Improved Heuristic for the Bounded Diameter Minimum Spanning Tree Problem. Journal of Soft Computing\u00a011, 911\u2013921 (2007)","journal-title":"Journal of Soft Computing"},{"key":"20_CR18","doi-asserted-by":"crossref","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. In: Genetic and Evolutionary Computational Conference. pp. 373\u2013380 (2009)","DOI":"10.1109\/ACIIDS.2009.89"},{"key":"20_CR19","unstructured":"Goldberg, D.E., Lingle, J.R.: Alleles, Loci, and the Travelling Salesman Problem. In: International Conference on Genetic Algorithms, pp. 154\u2013159 (1985)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society\u00a041, 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"}],"container-title":["Communications in Computer and Information Science","Contemporary Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22606-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T01:36:11Z","timestamp":1638236171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22606-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226052","9783642226069"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22606-9_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}