{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:22:02Z","timestamp":1729617722295,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccnc.2006.1593134","type":"proceedings-article","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T14:29:31Z","timestamp":1140013771000},"page":"725-729","source":"Crossref","is-referenced-by-count":1,"title":["Routing multiple multicast services using genetic algorithms"],"prefix":"10.1109","volume":"2","author":[{"given":"L.S.","family":"Randaccio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Atzori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Aste","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/HICSS.2003.1174822"},{"key":"11","article-title":"A genetic algorithm for shortest path routing problem and the sizing of population","volume":"6","author":"ahn","year":"2002","journal-title":"IEEE Transaction on Evolutionary Computation"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1016\/S0140-3664(03)00185-3"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1109\/90.748092"},{"key":"2","first-page":"573","article-title":"An approximation solution for the Steiner tree problem in graphs","volume":"24","author":"takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/GLOCOM.1995.502623"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/LCOMM.2004.831328"},{"key":"7","first-page":"720","article-title":"The multicast tree based routing for the complete broadcast multipoint-to-multipoint communications","volume":"e78 b","author":"priwan","year":"1995","journal-title":"IEICE Trans Commun"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1016\/S0305-0548(98)00075-6"},{"key":"5","first-page":"1898","article-title":"A fast multicast routing algorithm for delay-sensitive applications","author":"chung","year":"1997","journal-title":"Proceedings of GLOBECOM'97"},{"key":"4","first-page":"377","article-title":"A source-based algorithm for delay-constrained minimum-cost multicasting","author":"zhu","year":"1995","journal-title":"Proceedings of IEEE Infocom'95"},{"key":"9","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(00)00092-7","article-title":"Heuristic algorithms for packing of multiple-group multicasting","volume":"29","author":"wang","year":"2002","journal-title":"Computer & Operations research"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/90.851977"}],"event":{"name":"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.","location":"Las Vegas, NV, USA"},"container-title":["CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10599\/33506\/01593134.pdf?arnumber=1593134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T23:12:28Z","timestamp":1497654748000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1593134\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ccnc.2006.1593134","relation":{},"subject":[]}}