{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T05:06:46Z","timestamp":1736485606488,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_18","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"163-174","source":"Crossref","is-referenced-by-count":12,"title":["A Near Optimal Scheduler for On-Demand Data Broadcasts"],"prefix":"10.1007","author":[{"given":"Hing-Fung","family":"Ting","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1109\/90.811450","volume":"7","author":"D. Aksoy","year":"1999","unstructured":"Aksoy, D., Franklin, M.: R\u00d7W: a scheduling approach for large-scale on-demand data broadcast. IEEE\/ACM Transactions on networking\u00a07(6), 846\u2013860 (1999)","journal-title":"IEEE\/ACM Transactions on networking"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Chan, W.T., Lam, T.W., Ting, H.F., Wong, W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Proceedings of the 10th Annual International Conference on Computing and Combinatorics, pp. 210\u2013218","DOI":"10.1007\/978-3-540-27798-9_24"},{"key":"18_CR3","unstructured":"Edmonds, J., Pruhs, K.: A maiden analysis of longest wait first. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 818\u2013827 (2004)"},{"key":"18_CR4","unstructured":"Fung, S.P.Y.: Online algorithms for the provision of quality of service in networks. PhD thesis, The University of Hong Kong (2005)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Jiang, S., Vaidya, N.H.: Scheduling data broadcast to \u201dimpatient\u201d users. In: Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access, pp. 52\u201359 (1999)","DOI":"10.1145\/313300.313385"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1013225328395","volume":"7","author":"S. Jiang","year":"2002","unstructured":"Jiang, S., Vaidya, N.H.: Response time in data broadcast systems: Mean, variance and tradeoff. Mobile Networks and Applications\u00a07(1), 37\u201347 (2002)","journal-title":"Mobile Networks and Applications"},{"issue":"6","key":"18_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jos.87","volume":"4","author":"B. Kalyanasundaram","year":"2001","unstructured":"Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. Journal of Scheduling\u00a04(6), 339\u2013354 (2001)","journal-title":"Journal of Scheduling"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-39658-1_30","volume-title":"Algorithms - ESA 2003","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 313\u2013324. Springer, Heidelberg (2003)"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.tcs.2004.02.047","volume":"325","author":"J.H. Kim","year":"2004","unstructured":"Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. Theoretical Computer Science\u00a0325(3), 448\u2013479 (2004)","journal-title":"Theoretical Computer Science"},{"key":"18_CR10","unstructured":"Lipton, R., Tomkins, A.: Online interval scheduling. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 302\u2013311 (1994)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Acharya, S.: Scheduling on-demand broadcasts: new metrics and algorithms. In: The Fourth Annual ACM\/IEEE International Conference on Mobile Computing and Networking, pp. 43\u201354 (1998)","DOI":"10.1145\/288235.288248"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Pruhs, K., Uthaisombut, P.: A comparison of multicast pull models. In: Proceedings of the 10th Annual European Symposium on Algorithms, pp. 808\u2013819 (2002)","DOI":"10.1007\/3-540-45749-6_70"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science\u00a0130, 5\u201316 (1994)","journal-title":"Theoretical Computer Science"},{"key":"18_CR14","unstructured":"Zhang, F., Fung, P.Y., Chin, F., Poon, C.K., Xu, Y.: Improved on-line broadcast scheduling with deadlines. Technical report (submitted for publication)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:17:10Z","timestamp":1736399830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11758471_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}