{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:33:15Z","timestamp":1742985195590,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896937"},{"type":"electronic","value":"9783540896944"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89694-4_16","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T10:25:26Z","timestamp":1228818326000},"page":"151-160","source":"Crossref","is-referenced-by-count":1,"title":["Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm"],"prefix":"10.1007","author":[{"given":"\u00c1ngel M.","family":"P\u00e9rez-Bellido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sancho","family":"Salcedo-Sanz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio G.","family":"Ortiz-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Portilla-Figueras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Naldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1016\/j.comcom.2005.01.001","volume":"28","author":"Y.J. Lee","year":"2005","unstructured":"Lee, Y.J., Atiquzzaman, M.: Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem. Computer Communications\u00a028, 1371\u20131379 (2005)","journal-title":"Computer Communications"},{"issue":"6","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1049\/iet-com:20060544","volume":"1","author":"Y.J. Lee","year":"2007","unstructured":"Lee, Y.J., Atiquzzaman, M.: Exact algorithm for delay-constrained capacitated minimum spanning tree network. IET Communications\u00a01(6), 1238\u20131247 (2007)","journal-title":"IET Communications"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"2520","DOI":"10.1016\/j.cor.2005.09.018","volume":"34","author":"T. Thomadsen","year":"2007","unstructured":"Thomadsen, T., Larsen, J.: A hub location problem with fully interconnected backbone and access networks. Computers & Operations Research\u00a034, 2520\u20132531 (2007)","journal-title":"Computers & Operations Research"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Astic, I., Festor, O.: A hierarchical topology discovery sevice for IPv6 networks. In: Proc. of the IEEE\/IFIP Network Operations and Management Symposium, pp. 497\u2013510 (2002)","DOI":"10.1109\/NOMS.2002.1015604"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bejerano, Y., Breitbart, M., Rastogi, R.: Physical topology discovery for large multi subnet networks. In: Proc. of IEEE INFOCOM 2003, pp. 342\u2013352 (2003)","DOI":"10.1109\/INFCOM.2003.1208686"},{"key":"16_CR6","unstructured":"Gavish, B.: Parallel savings heuristic for the topological design of local access tree networks. In: Proc. of IEEE INFOCOM 2003, pp. 130\u2013139 (2003)"},{"key":"16_CR7","first-page":"142","volume":"3","author":"L. Esau","year":"1996","unstructured":"Esau, L., Williams, K.: On teleprocessing system design, part II. IBM System Journal\u00a03, 142\u2013147 (1996)","journal-title":"IBM System Journal"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230030204","volume":"3","author":"K.M. Chandy","year":"1973","unstructured":"Chandy, K.M., Lo, T.: The capacitated minimum spanning tree. Networks\u00a03, 173\u2013181 (1973)","journal-title":"Networks"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C. Papadimitriou","year":"1978","unstructured":"Papadimitriou, C.: The complexity of the capacitated minimum spanning tree problem. Networks\u00a08, 217\u2013230 (1978)","journal-title":"Networks"},{"key":"16_CR10","unstructured":"Karaman, A., Hassanein, H.: DCMC\u2013delay constrained multipoint communication with multiple sources. In: Proc. of the IEEE International Symposium on Computers and Communications (2003)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/90.842145","volume":"8","author":"D.S. Reeves","year":"2000","unstructured":"Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE\/ACM Transactions on Networking\u00a08(2), 239\u2013250 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TEVC.2006.871249","volume":"10","author":"T. Paulden","year":"2006","unstructured":"Paulden, T., Smith, D.K.: From the Dandelion code to the Rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality. IEEE Trans. Evol. Comput.\u00a010(2), 108\u2013123 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TEVC.2006.880730","volume":"11","author":"E. Thompson","year":"2007","unstructured":"Thompson, E., Paulden, T., Smith, D.K.: The Dandelion code: a new coding of spanning trees for genetic algorithms. IEEE Trans. Evol. Comput.\u00a011(1), 91\u2013100 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR14","first-page":"65","volume":"151","author":"N. Deo","year":"2001","unstructured":"Deo, N., Micikevicius, P.: Pr\u00fcfer-like codes for labeled trees. Congressus Numerantium\u00a0151, 65\u201373 (2001)","journal-title":"Congressus Numerantium"},{"key":"16_CR15","unstructured":"Picciotto, S.: How to encode a tree, Ph.D. dissertation, Univ. California, San Diego (1999)"},{"key":"16_CR16","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalisations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89694-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T02:46:58Z","timestamp":1738810018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89694-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896937","9783540896944"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89694-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}