{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:35Z","timestamp":1759637975975},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_40","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"444-455","source":"Crossref","is-referenced-by-count":10,"title":["Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungjin","family":"Im","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"40_CR1","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/98.475988","volume":"2","author":"S. Acharya","year":"1995","unstructured":"Acharya, S., Franklin, M., Zdonik, S.: Dissemination-based data delivery using broadcast disks. IEEE Pers. Commun.\u00a02(6), 50\u201360 (1995)","journal-title":"IEEE Pers. Commun."},{"issue":"6","key":"40_CR2","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1109\/90.811450","volume":"7","author":"D. Aksoy","year":"1999","unstructured":"Aksoy, D., Franklin, M.J.: rxw: A scheduling approach for large-scale on-demand data broadcast. IEEE\/ACM Trans. Netw.\u00a07(6), 846\u2013860 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"40_CR3","unstructured":"Bansal, N., Charikar, M., Khanna, S., Naor, J.S.: Approximating the average response time in broadcast scheduling. In: SODA, pp. 215\u2013221 (2005)"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Coppersmith, D., Sviridenko, M.: Improved approximation algorithms for broadcast scheduling. In: SODA, pp. 344\u2013353 (2006)","DOI":"10.1145\/1109557.1109596"},{"key":"40_CR5","unstructured":"Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: SODA, pp. 558\u2013559 (2000)"},{"key":"40_CR6","unstructured":"Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: SODA, pp. 270\u2013279 (1998)"},{"issue":"2","key":"40_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10951-007-0038-4","volume":"11","author":"M.A. Bender","year":"2008","unstructured":"Bender, M.A., Clifford, R., Tsichlas, K.: Scheduling algorithms for procrastinators. J. Scheduling\u00a011(2), 95\u2013104 (2008)","journal-title":"J. Scheduling"},{"key":"40_CR8","unstructured":"Bender, M.A., Muthukrishnan, S., Rajaraman, R.: Improved algorithms for stretch scheduling. In: SODA, pp. 762\u2013771 (2002)"},{"key":"40_CR9","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":"40_CR10","unstructured":"Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: algorithms and complexity. In: SODA, pp. 473\u2013482 (2008)"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Im, S., Moseley, B.: Longest wait first for broadcast scheduling (manuscript, 2009)","DOI":"10.1007\/978-3-642-12450-1_6"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Im, S., Moseley, B.: Minimizing maximum response time and delay factor in broadcast scheduling. CoRR, abs\/0906.2048 (2009)","DOI":"10.1007\/978-3-642-04128-0_40"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Moseley, B.: Online scheduling to minimize the maximum delay factor. In: SODA, pp. 1116\u20131125 (2009)","DOI":"10.1137\/1.9781611973068.121"},{"issue":"1","key":"40_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10951-006-5595-4","volume":"9","author":"M. Chrobak","year":"2006","unstructured":"Chrobak, M., D\u00fcrr, C., Jawor, W., Kowalik, L., Kurowski, M.: A note on scheduling equal-length jobs to maximize throughput. J. Scheduling\u00a09(1), 71\u201373 (2006)","journal-title":"J. Scheduling"},{"issue":"3","key":"40_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00453-003-1018-5","volume":"36","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J., Pruhs, K.: Multicast pull scheduling: When fairness is fine. Algorithmica\u00a036(3), 315\u2013330 (2003)","journal-title":"Algorithmica"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K.: Scalably scheduling processes with arbitrary speedup curves. In: SODA, pp. 685\u2013692 (2009)","DOI":"10.1137\/1.9781611973068.75"},{"key":"40_CR17","unstructured":"Erlebach, T., Hall, A.: Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In: SODA, pp. 194\u2013202 (2002)"},{"issue":"4","key":"40_CR18","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.J.: Algorithms for minimizing response time in broadcast scheduling. Algorithmica\u00a038(4), 597\u2013608 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"40_CR19","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM\u00a053(3), 324\u2013360 (2006)","journal-title":"J. ACM"},{"issue":"4","key":"40_CR20","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"issue":"6","key":"40_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jos.87","volume":"4","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. J. Scheduling\u00a04(6), 339\u2013354 (2000)","journal-title":"J. Scheduling"},{"issue":"3","key":"40_CR22","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. Theor. Comput. Sci.\u00a0325(3), 479\u2013488 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"40_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1243401.1243411","volume":"34","author":"K. Pruhs","year":"2007","unstructured":"Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev.\u00a034(4), 52\u201358 (2007)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"40_CR24","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online Scheduling. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004)"},{"issue":"3-4","key":"40_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-005-1170-1","volume":"42","author":"K. Pruhs","year":"2005","unstructured":"Pruhs, K., Uthaisombut, P.: A comparison of multicast pull models. Algorithmica\u00a042(3-4), 289\u2013307 (2005)","journal-title":"Algorithmica"},{"issue":"12","key":"40_CR26","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1109\/5.16350","volume":"76","author":"J. Wong","year":"1988","unstructured":"Wong, J.: Broadcast delivery. Proc. IEEE\u00a076(12), 1566\u20131577 (1988)","journal-title":"Proc. IEEE"},{"key":"40_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11809678_34","volume-title":"Computing and Combinatorics","author":"F. Zheng","year":"2006","unstructured":"Zheng, F., Fung, S.P.Y., Chan, W.-T., Chin, F.Y.L., Poon, C.K., Wong, P.W.H.: Improved on-line broadcast scheduling with deadlines. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 320\u2013329. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:05Z","timestamp":1558524125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}