{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T14:19:05Z","timestamp":1736518745680,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_34","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"320-329","source":"Crossref","is-referenced-by-count":17,"title":["Improved On-Line Broadcast Scheduling with Deadlines"],"prefix":"10.1007","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley P. Y.","family":"Fung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wun-Tat","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Aksoy, D., Franklin, M.: Scheduling for large scale on-demand data broadcast. In: Proc. of IEEE INFOCOM, pp. 651\u2013659 (1998)","DOI":"10.1109\/INFCOM.1998.665086"},{"key":"34_CR2","unstructured":"Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: Proc. 11th SODA, pp. 558\u2013559 (2000)"},{"key":"34_CR3","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-27798-9_24","volume-title":"Computing and Combinatorics","author":"W.-T. Chan","year":"2004","unstructured":"Chan, W.-T., Lam, T.-W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 210\u2013218. Springer, Heidelberg (2004)"},{"key":"34_CR5","unstructured":"Edmonds, J., Pruhs, K.: Broadcast scheduling: when fairness is fine. In: Proc. 13th SODA, pp. 421\u2013430 (2002)"},{"key":"34_CR6","unstructured":"Erlebach, T., Hall, A.: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In: Proc. 13th ACM-SIAM SODA, pp. 194\u2013202 (2002)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11560586_21","volume-title":"Theoretical Computer Science","author":"S.P.Y. Fung","year":"2005","unstructured":"Fung, S.P.Y., Chin, F.Y.L., Poon, C.K.: Laxity helps in broadcast scheduling. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol.\u00a03701, pp. 251\u2013264. Springer, Heidelberg (2005)"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00453-003-1058-x","volume":"38","author":"R. Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Kim, Y.A., Wan, Y.C.: Algorithms for minimizing response time in broadcast scheduling. Algorithmica\u00a038(4), 597\u2013608 (2004)","journal-title":"Algorithmica"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, S., Vaidya, N.: Scheduling data broadcasts to \u201cimpatient\u201d users. In: Proc. ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 52\u201359 (1999)","DOI":"10.1145\/313300.313385"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-45253-2_27","volume-title":"Algorithms - ESA 2000","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"issue":"3","key":"34_CR11","doi-asserted-by":"publisher","first-page":"479","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), 479\u2013488 (2004)","journal-title":"Theoretical Computer Science"},{"key":"34_CR12","unstructured":"DirecPC\u00a0Home Page, http:\/\/www.direcpc.com\/"},{"key":"34_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.: Online scheduling of jobs with fixed start and end times. Theoretical Computer Science\u00a0130, 5\u201316 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2005.09.001","volume":"97","author":"F. Zheng","year":"2006","unstructured":"Zheng, F., Chin, F.Y.L., Fung, S.P.Y., Poon, C.K., Xu, Y.: A tight lower bound for job scheduling with cancellation. Information Processing Letters\u00a097(1), 1\u20133 (2006)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:07:11Z","timestamp":1736514431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11809678_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}