{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:06:10Z","timestamp":1729652770448,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1109\/icon.2008.4772657","type":"proceedings-article","created":{"date-parts":[[2009,2,9]],"date-time":"2009-02-09T15:39:14Z","timestamp":1234193954000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Delay bound multicast routing algorithm using evolutionary programming"],"prefix":"10.1109","author":[{"given":"Sushma","family":"Jain","sequence":"first","affiliation":[]},{"given":"Jaydev","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2006.04.012"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004486"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(97)00124-2"},{"key":"13","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/S0140-3664(00)00273-5","article-title":"bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm","volume":"24","author":"zhengying","year":"2001","journal-title":"Computer Communications"},{"key":"14","doi-asserted-by":"crossref","first-page":"1394","DOI":"10.1016\/S0140-3664(99)00113-9","article-title":"qos routing based on genetic algorithm","volume":"22","author":"xiang","year":"1999","journal-title":"Computer Communications"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/49.564132"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/4235.752920"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1080\/0020739830140103"},{"key":"2","first-page":"573","article-title":"an approximate solution for the steiner problem in graphs","volume":"24","author":"takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/90.720901"},{"key":"7","first-page":"17","article-title":"the trade-offs of multicast trees and algorithms","author":"wei","year":"1994","journal-title":"Proceedings of the Third International Conference on Computer Communications and Networking (IC 3N '94)"},{"key":"6","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":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337651"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1996.497913"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095818"}],"event":{"name":"2008 16th IEEE International Conference on Networks","start":{"date-parts":[[2008,12,12]]},"location":"New Delhi, India","end":{"date-parts":[[2008,12,14]]}},"container-title":["2008 16th IEEE International Conference on Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4760205\/4772559\/04772657.pdf?arnumber=4772657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T12:36:21Z","timestamp":1497789381000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4772657\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icon.2008.4772657","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}