{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:00:12Z","timestamp":1648508412661},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p> We consider a problem of cost-constrained minimum-delay multicasting in a network, which is to find a Steiner tree spanning the source and destination nodes such that the maximum total delay along a path from the source node to a destination node is minimized, while the sum of link costs in the tree is bounded by a constant. The problem is NP-hard even if the network is series-parallel. We present a fully polynomial time approximation scheme for the problem if the network is series-parallel. <\/jats:p>","DOI":"10.1142\/s0219265908002205","type":"journal-article","created":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T01:51:53Z","timestamp":1220233913000},"page":"141-155","source":"Crossref","is-referenced-by-count":0,"title":["COST-CONSTRAINED MINIMUM-DELAY MULTICASTING"],"prefix":"10.1142","volume":"09","author":[{"given":"SATOSHI","family":"TAYU","sequence":"first","affiliation":[{"name":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan"}]},{"given":"TURKI GHAZI","family":"AL-MUTAIRI","sequence":"additional","affiliation":[{"name":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan"}]},{"given":"SHUICHI","family":"UENO","sequence":"additional","affiliation":[{"name":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00088-4"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"rf6","first-page":"213","volume":"6","author":"Parsa M.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(98)00208-4"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130202"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.1.70"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00029-4"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265908002205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T18:00:51Z","timestamp":1565200851000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265908002205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":9,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1142\/S0219265908002205"],"URL":"https:\/\/doi.org\/10.1142\/s0219265908002205","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}