{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:16:52Z","timestamp":1742933812449,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_35","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"362-373","source":"Crossref","is-referenced-by-count":1,"title":["Customized Newspaper Broadcast: Data Broadcast with Dependencies"],"prefix":"10.1007","author":[{"given":"Sandeep","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Schabanel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Acharya, S.: Broadcast Disks: Dissemination-based Management for Assymmetric Communication Environments. PhD thesis, Brown University (May 1998)"},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0166-5316(85)90024-0","volume":"5","author":"M.H. Ammar","year":"1985","unstructured":"Ammar, M.H., Wong, J.W.: The design of teletext broadcast cycles. Performance Evaluation\u00a05(4), 235\u2013242 (1985)","journal-title":"Performance Evaluation"},{"key":"35_CR3","unstructured":"Anily, S., Glass, C.A., Hassin, R.: The scheduling of maintenance service (1995)"},{"key":"35_CR4","unstructured":"Bansal, N., Charikar, M., Khanna, S., Naor, J.S.: Approximation the average response time in broadcast scheduling. In: Proc. of ACM-SIAM SODA (2005)"},{"issue":"3","key":"35_CR5","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. of Op. Research\u00a027(3), 518\u2013544 (2002)","journal-title":"Math. of Op. Research"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1024632031440","volume":"9","author":"A. Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Naor, J.S., Schieber, B.: Pushing dependent data in clientsproviders- servers systems. Wireless Networks\u00a09, 421\u2013430 (2003)","journal-title":"Wireless Networks"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Nisgav, A., Patt-Shamir, B.: Nearly optimal perfectly-periodic schedules. In: Proc. of ACM PODC 2001, pp. 107\u2013116 (2001)","DOI":"10.1145\/383962.383998"},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1006\/jpdc.1999.1618","volume":"60","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Shilo, Y.: Optimal broadcasting of two files over an asymmetric channel. J. Parallel Distrib. Comput.\u00a060(4), 474\u2013493 (2000)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0196-6774(03)00089-0","volume":"49","author":"Z. Brakerski","year":"2003","unstructured":"Brakerski, Z., Dreizin, V., Patt-Shamir, B.: Dispatching in perfectly-periodic schedules. J. Algorithms\u00a049(2), 219\u2013239 (2003)","journal-title":"J. Algorithms"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11511854_9","volume-title":"Database: Enterprise, Skills and Innovation","author":"K. Cai","year":"2005","unstructured":"Cai, K., Lin, H., Chen, C.: Correlation-based data broadcasting in wireless networks. In: Jackson, M., Nelson, D., Stirk, S. (eds.) BNCOD 2005. LNCS, vol.\u00a03567, pp. 111\u2013119. Springer, Heidelberg (2005)"},{"issue":"3","key":"35_CR11","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":"35_CR12","volume-title":"An Introduction to Probability Theory","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory, 3rd edn., vol.\u00a0I. John Wiley & Sons, Chichester (1968)","edition":"3"},{"key":"35_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Huang, J.-L., Chen, M.-S.: Broadcast program generation for unordered queries with data replication. In: Proc. of the ACM SAC, March 2003, pp. 866\u2013870 (2003)","DOI":"10.1145\/952532.952704"},{"issue":"9","key":"35_CR15","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/TKDE.2004.39","volume":"16","author":"J.-L. Huang","year":"2004","unstructured":"Huang, J.-L., Chen, M.-S.: Dependent data broadcasting for unordered queries in a multiple channel mobile environment. IEEE Trans. on Knowledge and Data Engineering\u00a016(9), 1143\u20131156 (2004)","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"35_CR16","first-page":"147","volume":"35","author":"C. Kenyon","year":"2002","unstructured":"Kenyon, C., Schabanel, N.: The data broadcast problem with non-uniform transmission time. Algorithmica\u00a035, 147\u2013175 (2002)","journal-title":"Algorithmica"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Schabanel, N., Young, N.: Polynomial-time approximation scheme for data broadcast. In: Proc. of ACM STOC, pp. 659\u2013666 (2000)","DOI":"10.1145\/335305.335398"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/B:MONE.0000031585.26814.2d","volume":"9","author":"F.J. Ovalle-Mart\u00ednez","year":"2004","unstructured":"Ovalle-Mart\u00ednez, F.J., Gonz\u00e1lez, J.S., Stojmenovi\u0107, I.: A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems. Mobile Network and Applications\u00a09, 257\u2013264 (2004)","journal-title":"Mobile Network and Applications"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-46541-3_15","volume-title":"STACS 2000","author":"N. Schabanel","year":"2000","unstructured":"Schabanel, N.: The data broadcast problem with preemption. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 181\u2013192. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:37:43Z","timestamp":1558273063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11682462_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}