{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:57:06Z","timestamp":1725555426548},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124495"},{"type":"electronic","value":"9783642124501"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12450-1_6","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T19:01:49Z","timestamp":1273086109000},"page":"62-74","source":"Crossref","is-referenced-by-count":6,"title":["Longest Wait First for Broadcast Scheduling [Extended Abstract]"],"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":"6_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":"6_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":"6_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":"6_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":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the l p norm: a rising tide lifts all boat. In: STOC, pp. 242\u2013250 (2003)","DOI":"10.1145\/780579.780580"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/moor.27.3.518.314","volume":"27","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J.S., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. Oper. Res.\u00a027(3), 518\u2013544 (2002)","journal-title":"Math. Oper. Res."},{"key":"6_CR7","unstructured":"Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: SODA, pp. 558\u2013559 (2000)"},{"issue":"2","key":"6_CR8","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":"6_CR9","unstructured":"Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: algorithms and complexity. In: SODA, pp. 473\u2013482 (2008)"},{"key":"6_CR10","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":"6_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0304-3975(99)00186-3","volume":"235","author":"J. Edmonds","year":"2000","unstructured":"Edmonds, J.: Scheduling in the dark. Theor. Comput. Sci.\u00a0235(1), 109\u2013141 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"6_CR12","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"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1077464.1077467","volume":"1","author":"J. Edmonds","year":"2005","unstructured":"Edmonds, J., Pruhs, K.: A maiden analysis of longest wait first. ACM Trans. Algorithms\u00a01(1), 14\u201332 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"6_CR14","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":"6_CR15","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":"6_CR16","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":"6_CR17","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"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-44867-5_12","volume-title":"Experimental and Efficient Algorithms","author":"A. Hall","year":"2003","unstructured":"Hall, A., T\u00e4ubig, H.: Comparing push- and pull-based broadcasting. or: Would \u201cmicrosoft watches\u201d profit from a transmitter? In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.\u00a02647, pp. 148\u2013164. Springer, Heidelberg (2003)"},{"issue":"4","key":"6_CR19","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":"6_CR20","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":"4","key":"6_CR21","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."},{"issue":"12","key":"6_CR22","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"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12450-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:54:08Z","timestamp":1606186448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12450-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124495","9783642124501"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12450-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}