{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:34Z","timestamp":1725574114724},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_5","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:32:30Z","timestamp":1294439550000},"page":"47-58","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for Channel Allocation Problems in Broadcast Networks"],"prefix":"10.1007","author":[{"given":"Rajiv","family":"Gandhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast Disks: Data management for asymmetric communication environments. In: Proc. ACM SIGMOD International Conference on Management of Data, San Jose, CA (1995)","DOI":"10.1145\/223784.223816"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Acharya, S., Franklin, M., Zdonik, S.: Balancing push and pull for data broadcast. In: Proc. ACM SIGMOD International Conference on Management of Data, Tuscon, AZ (1997)","DOI":"10.1145\/253260.253293"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-48962-2_14","volume-title":"Advanced Multimedia Content Processing","author":"D. Aksoy","year":"1999","unstructured":"Aksoy, D., Altinel, M., Bose, R., Cetintemel, U., Franklin, M., Wang, J., Zdonik, S.: Research in Data Broadcast and Dissemination. In: Nishio, S., Kishino, F. (eds.) AMCP 1998. LNCS, vol.\u00a01554, p. 194. Springer, Heidelberg (1999)"},{"key":"5_CR4","unstructured":"Bhatia, R.: Approximation Algorithms for Scheduling Problems. Ph.D. Thesis, University of Maryland at College Park (1998)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics\u00a023, 493\u2013509 (1952)","journal-title":"Annals of Mathematical Statistics"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Math. of Oper. Res.\u00a04(3), 233\u2013235 (1979)","journal-title":"Math. of Oper. Res."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Crespo, A., Buyukkokten, O., Garcia-Molina, H.: Efficient Query Processing in a Multicast Environment. In: Proceedings of the 16th International Conference on Data Engineering (ICDE), San Diego (2000)","DOI":"10.1109\/ICDE.2000.839391"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1080\/002075497195164","volume":"35","author":"M.S. Daskin","year":"1997","unstructured":"Daskin, M.S., Maimon, O., Shtub, A., Braha, D.: Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: problem characteristics and solution procedures. International Journal of Production Research\u00a035, 1617\u20131638 (1997)","journal-title":"International Journal of Production Research"},{"key":"5_CR9","unstructured":"Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 717\u2013724 (2003)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The Dense k-Subgraph Problem. Algorithmica\u00a029, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Franklin, M., Zdonik, S.: A framework for scalable dissemination-based systems. In: Proc. Object Oriented Programming Systems, Languages and Applications, OOPSLA (1997)","DOI":"10.1145\/263698.263725"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Franklin, M., Zdonik, S.: Data in your face: push technology in perspective. In: Proceedings of ACM SIGMOD International Conference on Management of Data (1998)","DOI":"10.1145\/276304.276360"},{"key":"5_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.10054","volume":"41","author":"O. Goldschmidt","year":"2003","unstructured":"Goldschmidt, O., Hochbaum, D., Levin, A., Olinick, E.: The SONET Edge-Partition Problem. Networks\u00a041, 13\u201323 (2003)","journal-title":"Networks"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1002\/(SICI)1098-2418(199705)10:3<385::AID-RSA6>3.0.CO;2-S","volume":"10","author":"D.A. Grable","year":"1997","unstructured":"Grable, D.A., Panconesi, A.: Nearly optimal distributed edge coloring in O(log log n) rounds. Random Structures & Algorithms\u00a010, 385\u2013405 (1997)","journal-title":"Random Structures & Algorithms"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. American Statistical Association Journal\u00a058, 13\u201330 (1963)","journal-title":"American Statistical Association Journal"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S. Janson","year":"1990","unstructured":"Janson, S.: Poisson approximations for large deviations. Random Structures & Algorithms\u00a01, 221\u2013230 (1990)","journal-title":"Random Structures & Algorithms"},{"key":"5_CR18","unstructured":"Janson, S. Ruci\u0144ski, A.: The deletion method for upper tail estimates. Technical Report 2000:28, Department of Mathematics, Uppsala University, Sweden (2000)"},{"key":"5_CR19","unstructured":"Jia, L., Rajaraman, R., Suel, T.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proc. ACM Symposium on Principles of Distributed Computing, pp. 33\u201342 (2001)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1002\/rsa.10032","volume":"20","author":"V.H. Vu","year":"2002","unstructured":"Vu, V.H.: Concentration of non-Lipschitz functions and applications. Random Structures & Algorithms\u00a020, 262\u2013316 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Wong, J.: Broadcast Delivery. Proc. of the IEEE 76(12) (1988)","DOI":"10.1109\/5.16350"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T11:12:40Z","timestamp":1553339560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}