{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:55:00Z","timestamp":1742396100579,"version":"3.38.0"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1109\/tc.2002.1004596","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"581-588","source":"Crossref","is-referenced-by-count":32,"title":["On finding feasible solutions for the delay constrained group multicast routing problem"],"prefix":"10.1109","volume":"51","author":[{"family":"Chor Ping Low","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xueyan Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/167954.166246"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/90.490746"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386390"},{"volume-title":"Computers and IntractabilityA Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(97)00081-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00222-X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/90.720901"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160305"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/49.564132"},{"key":"ref13","first-page":"452","article-title":"Efficient Multicast Routing for Delay-Sensitive Applications","volume-title":"Proc. Second Workshop Protocols for Multimedia Systems","author":"Sun"},{"key":"ref14","first-page":"573","article-title":"An Approximate Solution for the Steiner Problem in Graphs","volume":"6","author":"Takahashi","year":"1980","journal-title":"Math. Japonica"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45551-5_19"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/65.819168"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/21690\/01004596.pdf?arnumber=1004596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:09:05Z","timestamp":1742015345000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004596\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,5]]}},"URL":"https:\/\/doi.org\/10.1109\/tc.2002.1004596","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}