{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:40:11Z","timestamp":1737067211264,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000280"},{"type":"electronic","value":"9783540360872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36087-5_32","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T22:17:16Z","timestamp":1180909036000},"page":"272-280","source":"Crossref","is-referenced-by-count":8,"title":["A Genetic Algorithm for Steiner Tree Optimization with Multiple Constraints Using Pr\u00fcfer Number"],"prefix":"10.1007","author":[{"given":"A. T.","family":"Haghighat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Faez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Dehghan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Mowlaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Ghahremani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S. L. Hakimi","year":"1971","unstructured":"S. L. Hakimi: Steiner problem in graphs and its implications, Networks, Vol. 1, (1971) 113\u2013133.","journal-title":"Networks"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R. Karp","year":"1972","unstructured":"R. Karp: Reducibility among combinatorial problems, in: R. E. Miller, J. W. Thatcher, Complexity of computer computations, Plenum Press, New York, (1972) 85\u2013103."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1109\/90.720901","volume":"6","author":"M. Parsa","year":"1998","unstructured":"M. Parsa, Q. Zhu, J.J. Garcia-Luna-Aceves: An iterative algorithm for delay-constrained minimum-cost multicasting, IEEE\/ACM Transactions on Networking, Vol. 6, No. 4, (1998) 461\u2013474.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"V.P. Kompella, J.C. Pasquale, G.C. Polyzos: Multicast routing for multimedia communication, IEEE\/ACM Transactions on Networking, Vol. 1, No. 3, (1993) 286\u2013292.","journal-title":"IEEE\/ACM Transactions on Networking"},{"unstructured":"R. Widyono: The design and evaluation of routing algorithms for real-time channels, Technical Reports TR-94-024, Tenet Group, Dept. of EECS, University of California at Berkeley, (1994).","key":"32_CR5"},{"unstructured":"A. G. Waters: A new heuristic for ATM multicast routing, 2nd IFIP Workshop on Performance Modeling and Evaluation of ATM networks, (1994).","key":"32_CR6"},{"key":"32_CR7","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, Vol. 15, (1981) 141\u2013145.","journal-title":"Acta Informatica"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/0020739830140103","volume":"14","author":"V. Rayward-smith","year":"1983","unstructured":"V. Rayward-smith: The computation of nearly minimal steiner trees in graphs, International Journal of Mathematical Education in Science and Technology, Vol. 14, No. 1, (1983) 15\u201323.","journal-title":"International Journal of Mathematical Education in Science and Technology"},{"issue":"6","key":"32_CR9","first-page":"573","volume":"22","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi, A. Matsuyama: An approximate solution for the Steiner problem in graphs, Mathematica Japonica, Vol. 22, No. 6, (1980) 573\u2013577.","journal-title":"Mathematica Japonica"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/49.552065","volume":"15","author":"E. Gelenbe","year":"1997","unstructured":"E. Gelenbe, A. Ghanwani, V. Srinivasan: Improved neural heuristics for multicast routing, IEEE Journal of selected Area in Communication, Vol. 15, No. 2, (1997) 147\u2013155.","journal-title":"IEEE Journal of selected Area in Communication"},{"issue":"1","key":"32_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/HSN-1998-137","volume":"7","author":"Q. Sun","year":"1998","unstructured":"Q. Sun, H. Langend\u00f6rfer: An efficient delay-constrained multicast routing algorithm, Journal of High-Speed Networks, Vol. 7, No. 1, (1998) 43\u201355.","journal-title":"Journal of High-Speed Networks"},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/49.564132","volume":"15","author":"H.F. Salama","year":"1997","unstructured":"H.F. Salama, D.S. Reeves, Y. Viniotis: Evaluation of multicast routing algorithms for realtime communication on high-speed networks, IEEE Journal on Selected Areas in Communications, Vol. 15, No. 3, (1997) 332\u2013345.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"unstructured":"J. Hesser, R. M\u00e4nner, O. Stucky: Optimization of Steiner trees using genetic algorithms, Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA, (1989) 231\u2013236.","key":"32_CR13"},{"unstructured":"B.A. Julstrom: A genetic algorithm for the rectilinear Steiner problem, Proceedings of the 5th International Conference on Genetic Algorithms, (1993) 474\u2013480.","key":"32_CR14"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1038\/sj\/jors\/0440408","volume":"44","author":"A. Kapsalis","year":"1993","unstructured":"A. Kapsalis, V.J. Rayward-Smith, G.D. Smith: Solving the graphical Steiner tree problem using genetic algorithms, Journal of the Operational Research Society, Vol. 44, No. 4, (1993) 397\u2013406.","journal-title":"Journal of the Operational Research Society"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230260403","volume":"26","author":"H. Esbensen","year":"1995","unstructured":"H. Esbensen: Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm, Networks, Vol. 26, (1995) 173\u2013185.","journal-title":"Networks"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/4235.738982","volume":"2","author":"Y. Leung","year":"1998","unstructured":"Y. Leung, G. Li, Z.B. Xu: A genetic algorithm for the multiple destination routing problems, IEEE Transactions on Evolutionary Computation, Vol. 2, No. 4, (1998) 150\u2013161.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"32_CR18","volume-title":"Technical Report","author":"Q. Sun","year":"1999","unstructured":"Q. Sun: A genetic algorithm for delay-constrained minimum-cost multicasting, Technical Report, IBR, TU Braunschweig, Butenweg, 74\/75, 38106, Braunschweig, Germany, (1999)."},{"key":"32_CR19","first-page":"1394","volume":"22","author":"F. Xiang","year":"1999","unstructured":"F. Xiang, L. Junzhou, W. Jieyi, G. Guanqun: QoS routing based on genetic algorithm, Computer Communications, Vol. 22, (1999) 1394\u20131399.","journal-title":"Computer Communications"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0140-3664(97)00124-2","volume":"21","author":"C.P. Ravikumar","year":"1998","unstructured":"C.P. Ravikumar, R. Bajpai: Source-based delay-bounded multicasting in multimedia networks, Computer Communications, Vol. 21, (1998) 126\u2013132.","journal-title":"Computer Communications"},{"issue":"1","key":"32_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.752920","volume":"3","author":"Q. Zhang","year":"1999","unstructured":"Q. Zhang, Y.W. Lenug: An orthogonal genetic algorithm for multimedia multicast routing, IEEE Transactions on Evolutionary Computation, Vol. 3, No. 1, (1999) 53\u201362.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0020-0255(99)00102-4","volume":"124","author":"J. J. Wu","year":"2000","unstructured":"J. J. Wu, R. H. Hwang, H. I. Lu: Multicast routing with multiple QoS constraints in ATM networks, Information Sciences, Vol. 124, (2000) 29\u201357.","journal-title":"Information Sciences"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/S0140-3664(00)00273-5","volume":"24","author":"Z. Wang","year":"2001","unstructured":"Z. Wang, B. Shi, E. Zhao: Bandwidth-delay-constrainted least-cost multicast routing based on heuristic genetic algorithm, Computer Communications, Vol. 24, (2001) 685\u2013692.","journal-title":"Computer Communications"},{"issue":"3","key":"32_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0305-0548(97)00039-7","volume":"25","author":"G. Zhou","year":"1998","unstructured":"G. Zhou, M. Gen: An effective genetic algorithm approach to the quadratic minimum spanning tree problem, Computers and operations research, Vol. 25, No. 3, (1998) 229\u2013247.","journal-title":"Computers and operations research"}],"container-title":["Lecture Notes in Computer Science","EurAsia-ICT 2002: Information and Communication Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36087-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:07:50Z","timestamp":1737065270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36087-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000280","9783540360872"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-36087-5_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}