{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T14:52:20Z","timestamp":1785336740598,"version":"3.55.0"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"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. Commun."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/tcomm.2018.2865484","type":"journal-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T18:38:41Z","timestamp":1534271921000},"page":"6329-6338","source":"Crossref","is-referenced-by-count":5,"title":["Multicast Routing Using Delay Intervals for Collaborative and Competitive Applications"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5232-4531","authenticated-orcid":false,"given":"James","family":"Andrus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6866-3896","authenticated-orcid":false,"given":"Shankar M.","family":"Banik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8375-5390","authenticated-orcid":false,"given":"Breeanne Baker","family":"Swart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Verdicchio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"290","article-title":"On random graphs I","volume":"6","author":"erd?s","year":"1959","journal-title":"Publicationes Math"},{"key":"ref11","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC-SmartCity-DSS.2016.0075"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC-SmartCity-DSS.2017.20"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","article-title":"Computing the k shortest paths: A new algorithm and an experimental comparison","author":"jim\u00e9nez","year":"1999","journal-title":"Proc Workshop Algorithmic Eng"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2000.892050"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2015.7166575"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/49.564133"},{"key":"ref18","author":"sedgewick","year":"2016","journal-title":"Algorithms"},{"key":"ref19","first-page":"611","article-title":"A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem","author":"sheu","year":"2001","journal-title":"Proc 15th Int Conf Inf Netw"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1016540.1016556"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.45"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5685219"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2009.5202606"},{"key":"ref8","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1730836.1730863"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2011.117"},{"key":"ref1","author":"ballardie","year":"2201","journal-title":"Core Based Trees (CBT) Multicast Routing Architecture"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1996.493353"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8576802\/08435975.pdf?arnumber=8435975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T10:43:48Z","timestamp":1643280228000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8435975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":20,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2865484","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12]]}}}