{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:11:48Z","timestamp":1742386308997},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695134"},{"type":"electronic","value":"9783540695141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/11970125_3","type":"book-chapter","created":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T00:47:40Z","timestamp":1169599660000},"page":"29-42","source":"Crossref","is-referenced-by-count":9,"title":["Coping with Interference: From Maximum Coverage to Planning Cellular Networks"],"prefix":"10.1007","author":[{"given":"David","family":"Amzallag","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Raz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Ageev","year":"1999","unstructured":"Ageev, A., Sviridenko, M.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 17\u201330. Springer, Heidelberg (1999)"},{"key":"3_CR2","unstructured":"Amzallag, D., Engelberg, R., Naor, J., Raz, D.: Approximation algorithms for cell planning problems (2006) (Manuscript)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Amzallag, D., Livschitz, M., Naor, J., Raz, D.: Cell planning of 4G cellular networks: Algorithmic techniques, and results. In: Proceedings of the 6th IEE International Conference on 3G & Beyond (3G 2005), pp. 501\u2013506 (2005)","DOI":"10.1049\/cp:20050272"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: The all-or-nothing multicommodity flow problem. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 156\u2013165 (2004)","DOI":"10.1145\/1007352.1007383"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M., Salavatipour, M.R.: Combination can be hard: Approximability of the unique coverage problem. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 162\u2013171 (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"3_CR7","unstructured":"Gla\u00dfer, C., Reith, S., Vollmer, H.: The complexity of base station positiong in cellular networks. In: Workshop on Approximation and Randomized Algorithms in Communication Networks, pp. 167\u2013177 (2000)"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"D. Hochbaum","year":"1982","unstructured":"Hochbaum, D.: Heuristics for the fixed cost median problem. Mathematical Programming\u00a022(2), 148\u2013162 (1982)","journal-title":"Mathematical Programming"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01271266","volume":"16","author":"J. Kahn","year":"1996","unstructured":"Kahn, J., Linial, N., Samorodnitsky, A.: Inclusion-exclusion: exact and approximate. Combinatorica\u00a016, 465\u2013477 (1996)","journal-title":"Combinatorica"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Information Processing Letters\u00a070, 39\u201345 (1999)","journal-title":"Information Processing Letters"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02128670","volume":"10","author":"N. Linial","year":"1990","unstructured":"Linial, N., Nisan, N.: Approximate inclusion-exclusion. Combinatorica\u00a010, 349\u2013365 (1990)","journal-title":"Combinatorica"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M. Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters\u00a032, 41\u201343 (2004)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11970125_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:23:53Z","timestamp":1619493833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11970125_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695134","9783540695141"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11970125_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}