{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:40:02Z","timestamp":1737502802195,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_42","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"415-424","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling Broadcasts with Deadlines"],"prefix":"10.1007","author":[{"given":"Jae-Hoon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"S. Aacharya and S. Muthukrishnan. Scheduling on-demand broadcasts: new metrics and algorithms. In ACM\/IEEE International Conference on Mobile Computing and Networking, pages 43\u201354, 1998.","DOI":"10.1145\/288235.288248"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"D. Aksoy and M. Franklin. Scheduling for large scale on-demand data broadcast. In Proc. of IEEE INFOCOM, pages 651\u2013659, 1998.","DOI":"10.1109\/INFCOM.1998.665086"},{"key":"42_CR3","unstructured":"Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In Proc. of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 558\u2013559, 2000."},{"key":"42_CR4","unstructured":"J. Edmonds and K. Pruhs. Broadcast scheduling: when fairness is fine. In Proc. of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 421\u2013430, 2002."},{"key":"42_CR5","unstructured":"T. Erlebach and A. Hall. Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proc. of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 194\u2013202, 2002."},{"key":"42_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/3-540-47867-1_30","volume-title":"Proc. of 9th International Integer Programming and Combinatorial Optimization (IPCO) Conference","author":"R. Gandhi","year":"2002","unstructured":"R. Gandhi, S. Khuller, Y. A. Kim, and Y. C. Wan. Algorithms for minimizing response time in broadcast scheduling. In Proc. of 9th International Integer Programming and Combinatorial Optimization (IPCO) Conference, volume 2337 of Lecture Notes in Computer Science (LNCS), pages 425\u2013438. Springer-Verlag, 2002."},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"S. Jiang and N. Vaidya. Scheduling data broadcasts to \u201cimpatient\u201d users. In Proc. of the ACM International Workshop on Data Engineering for Wireless and Mobile Access, pages 52\u201359, 1999.","DOI":"10.1145\/313300.313385"},{"key":"42_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-45253-2_27","volume-title":"Proc. of 8th Annual European Symposium on Algorithms (ESA)","author":"B. Kalyanasundaram","year":"2000","unstructured":"B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In Proc. of 8th Annual European Symposium on Algorithms (ESA), volume 1879 of Lecture Notes in Computer Science (LNCS), pages 290\u2013301. Springer-Verlag, 2000."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram and M. Velauthapillai. Broadcast scheduling under deadline. private communication, 2003.","DOI":"10.1007\/978-3-540-39658-1_30"},{"key":"42_CR10","unstructured":"R. Lipton and A. Tomkins. Online interval scheduling. In Proc. of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 302\u2013311, 1994."},{"key":"42_CR11","unstructured":"DirecPC Home Page. http:\/\/www.direcpc.com\/."},{"key":"42_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms: The State of the Art","author":"J. Sgall","year":"1998","unstructured":"J. Sgall. Online scheduling. In Online Algorithms: The State of the Art, eds. A. Fiat and G. J. Woeginger, volume 1442 of Lecture Notes in Computer Science (LNCS), pages 196-231. Springer-Verlag, 1998."},{"key":"42_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/3-540-45253-2_39","volume-title":"Proc. of 8th Annual European Symposium on Algorithms (ESA)","author":"M. Akker van den","year":"2000","unstructured":"M. van den Akker, H. Hoogeven, and N. Vakhania. Restarts can help in the online minimization of the maximum delivery time on a single machine. In Proc. of 8th Annual European Symposium on Algorithms (ESA), volume 1879 of Lecture Notes in Computer Science (LNCS), pages 427\u2013436. Springer-Verlag, 2000."},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G. J. Woeginger","year":"1994","unstructured":"Gerhard J. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130:5\u201316, 1994.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:25:38Z","timestamp":1737501938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}