{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:53:56Z","timestamp":1725566036552},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540225713"},{"type":"electronic","value":"9783540278245"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27824-5_134","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T19:27:02Z","timestamp":1284578822000},"page":"1029-1034","source":"Crossref","is-referenced-by-count":9,"title":["Multiobjective Multicast Routing Algorithm"],"prefix":"10.1007","author":[{"given":"J.","family":"Crichigno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Bar\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"134_CR1","volume-title":"Computer Networks","author":"A. Tanenbaum","year":"2003","unstructured":"Tanenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs (2003)"},{"key":"134_CR2","unstructured":"Lee, Y., Seok, Y., Choi, Y.: Explicit Multicast Routing Algorithm for Constrained Traffic Engineering. In: Proc. of 7th Int. Symp. on Computer and Comm, ISCC 2002 (2002)"},{"issue":"3","key":"134_CR3","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V. Kompella","year":"1993","unstructured":"Kompella, V., Gupta, A.: Multicast routing in multimedia communication. IEEE\/ACM Transactions on Networking\u00a01(3), 286\u2013291 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"134_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0140-3664(97)00124-2","volume":"21","author":"C.P. Ravikumar","year":"1998","unstructured":"Ravikumar, C.P., Bajpai, R.: Source-based delay bounded multicasting in multimedia networks. Computer Communications\u00a021, 126\u2013132 (1998)","journal-title":"Computer Communications"},{"key":"134_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/S0140-3664(00)00273-5","volume":"24","author":"W. Zhengying","year":"2001","unstructured":"Zhengying, W., Bingxin, S., Erdun, Z.: Bandwidth-delay-constraint least-cost multicast routing based on heuristic genetic algorithm. Computer Communications\u00a024, 685\u2013692 (2001)","journal-title":"Computer Communications"},{"key":"134_CR6","unstructured":"de Araujo, P.T., Barbosa, G.M.: Proceedings of the VII Brazilian Symposium on Neural Networks (SBRN 2002). In: Proceedings of the VII Brazilian Symposium on Neural Networks, SBRN 2002 (2002)"},{"issue":"4","key":"134_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A comparative Case Study and the Strength Pareto Approach. IEEE Trans. Evolutionary Computation\u00a03(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"134_CR8","volume-title":"Genetic Algorithm is Search, Optimization & Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithm is Search, Optimization & Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"134_CR9","first-page":"885","volume":"16","author":"R.H. Hwang","year":"2000","unstructured":"Hwang, R.H., Do, W.Y., Yang, S.C.: Multicast Routing Based on Genetic Algorithms. Journal of Information Science and Engineering\u00a016, 885\u2013901 (2000)","journal-title":"Journal of Information Science and Engineering"},{"key":"134_CR10","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J. Yen","year":"1971","unstructured":"Yen, J.: Finding the k shortest loopless path in a network. Management Science\u00a017, 712\u2013716 (1971)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Telecommunications and Networking - ICT 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27824-5_134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:31:06Z","timestamp":1558290666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27824-5_134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540225713","9783540278245"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27824-5_134","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}