{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:21:29Z","timestamp":1740201689574,"version":"3.37.3"},"publisher-location":"London","reference-count":25,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781846286629"},{"type":"electronic","value":"9781846286636"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-1-84628-663-6_14","type":"book-chapter","created":{"date-parts":[[2010,5,27]],"date-time":"2010-05-27T14:15:40Z","timestamp":1274969740000},"page":"187-200","source":"Crossref","is-referenced-by-count":0,"title":["LSA-based Landscape Analysis for Multicast Routing"],"prefix":"10.1007","author":[{"given":"Mohammed S.","family":"Zahrani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James A.","family":"Malcolm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin J.","family":"Loomes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas A.","family":"Albrecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E. Aarts","year":"1998","unstructured":"E. Aarts. Local Search in Combinatorial Optimization. Wiley & Sons, New York, 1998."},{"key":"14_CR2","unstructured":"J. Beasley. OR library: http:\/\/people.brunel.ac.uk\/~ mastjjb\/jeb\/info.html."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"V. Cerny. A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45:41\u201351, 1985.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/nem.485","volume":"13","author":"D. Chakraborty","year":"2003","unstructured":"D. Chakraborty, G. Chakraborty, and N. Shiratori. A dynamic multicast routing satisfying multiple QoS constraints. International Journal of Network Management, 13:321\u2013335, 2003.","journal-title":"International Journal of Network Management"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/49.564128","volume":"15","author":"C. Diot","year":"1997","unstructured":"C. Diot, W. Dabbous, and J. Crowcroft. Multipoint communication: A survey of protocols, functions, and mechanisms. IEEE Journal on Selected Areas in Communication, 15:277\u2013290, 1997.","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"M. Doar and I. Leslie. How bad is na\u00efve multicast routing? In Proc. of IEEE INFOCOM\u201993, pp. 82\u201389, 1993.","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"P. Galiasso and R. Wainwright. A hybrid genetic algorithm for the point to multipoint routing problem with single split paths. In Proc. of ACM Symposium on Applied Computing (2001), pages 327\u2013332, 2001.","DOI":"10.1145\/372202.372354"},{"key":"14_CR8","volume-title":"Genetic Algorithms in Search","author":"D. Goldberg","year":"1989","unstructured":"D. Goldberg. Genetic Algorithms in Search. Addison-Wesley Publishing Co., Reading, MA, 1989."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"B. Hajek. Cooling schedules for optimal annealing. Mathematics of Operations Research, 13:311\u2013329, 1988.","journal-title":"Mathematics of Operations Research"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S. Hakimi","year":"1971","unstructured":"S. Hakimi. Steiner\u2019s problem in graphs and its implications. Networks, 1:113\u2013133, 1971.","journal-title":"Networks"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"T. Harrison and C. Williamson. A performance study of multicast routing algorithms for ATM networks. In Proc. of 21 st Annual IEEE Conference on Local Computer Networks, p. 191, 1996.","DOI":"10.1109\/LCN.1996.558147"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"J. Holland","year":"1992","unstructured":"J. Holland. Genetic algorithms. Scientific American, 267(1):66\u201372, 1992.","journal-title":"Scientific American"},{"key":"14_CR13","unstructured":"P. Kampstra. Evolutionary computing in telecommu-nications. In BMI paper (Vrije U. Amsterdam), 2005."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. G. Jr., and M. Vecchi. Optimization by simulated annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"L. Kou, G. Markowsky, L. Berman. A fast algorithm for Steiner trees. Acta Informatica, 15:141\u2013145, 1981.","journal-title":"Acta Informatica"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P. Merz","year":"2000","unstructured":"P. Merz and B. Freisleben. Fitness landscapes, m\u00eame-tic algorithms, and greedy operators for graph bipar-titioning. Evolutionary Computation, 8(1):61\u201381, 2000.","journal-title":"Evolutionary Computation"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"C. Oliveira","year":"2005","unstructured":"C. Oliveira and P. Pardalos. A survey of combinatorial optimization problems in multicast routing. Comput. & Operations Research, 32:1953\u20131981, 2005.","journal-title":"Comput. & Operations Research"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/jagm.2000.1086","volume":"36","author":"H. Pr\u00f6mel","year":"2000","unstructured":"H. Pr\u00f6mel, A. Steger. A new approximation algorithm for the Steiner tree problem with performance ratio 5\/3. Journal of Algorithms, 36:89\u2013101, 2000.","journal-title":"Journal of Algorithms"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G. Rudolph","year":"1994","unstructured":"G. Rudolph. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks, 5:96\u2013101, 1994.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/49.564132","volume":"13","author":"H. Salama","year":"1997","unstructured":"H. Salama, D. Reeves, and Y. Viniotis. Evaluation of multicast routing algorithms for real-time communi-cation on high-speed networks. IEEE Journal on Selected Areas in Communications, 13:332\u2013345, 1997.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00406-0","volume":"259","author":"L. Schmitt","year":"2001","unstructured":"L. Schmitt. Theory of genetic algorithms. Theoretical Computer Science, 259:1\u201361, 2001.","journal-title":"Theoretical Computer Science"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"4731","DOI":"10.1088\/0305-4470\/37\/17\/005","volume":"37","author":"M. Wolfinger","year":"2004","unstructured":"M. Wolfinger, W. Svrcek-Seiler, C. Flamm, I. Hofacker, and P. Stadler. Exactfolding dynamics of RNA secondary structures. Journal of Physics A: Mathematics and General, 37:4731\u20134741, 2004.","journal-title":"Journal of Physics A: Mathematics and General"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S1084-8045(03)00004-3","volume":"26","author":"C. Yeo","year":"2003","unstructured":"C. Yeo, B. Lee, and M. Er. A framework for multicast video streaming over IP networks. Journal of Network and Computer Applications, 26:273\u2013289, 2003.","journal-title":"Journal of Network and Computer Applications"},{"key":"14_CR25","unstructured":"L. Zhu, R. Wainwright, and D. Schoenefeld. A genetic algorithm for the point to multipoint routing problem with varying number of requests. In Proc. of IEEE International Conference on Evolutionary Computation, pp. 171\u2013176, 1998."}],"container-title":["Research and Development in Intelligent Systems XXIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84628-663-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T08:16:01Z","timestamp":1740125761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84628-663-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9781846286629","9781846286636"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-1-84628-663-6_14","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}