{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T17:09:41Z","timestamp":1768324181798,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280613","type":"print"},{"value":"9783540318064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_21","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"188-198","source":"Crossref","is-referenced-by-count":23,"title":["Interference in Cellular Networks: The Minimum Membership Set Cover Problem"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[]},{"given":"Pascal","family":"von Rickenbach","sequence":"additional","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Zollinger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","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. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. In: 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS (2002)","DOI":"10.1109\/SFCS.2002.1181994"},{"issue":"4","key":"21_CR3","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. Journal of the ACM (JACM)\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM (JACM)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01651330","volume":"22","author":"C. Fortuin","year":"1971","unstructured":"Fortuin, C., Kasteleyn, P., Ginibre, J.: Correlations Inequalities on Some Partially Ordered Sets. Comm. Math. Phys.\u00a022, 89\u2013103 (1971)","journal-title":"Comm. Math. Phys."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1017\/S0305004100034241","volume":"60","author":"T.E. Harris","year":"1960","unstructured":"Harris, T.E.: A Lower Bound for the Critical Probability in a Certain Percolation Process. Proc. Cambridge Philos. Soc.\u00a060, 13\u201320 (1960)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/0471224561.ch5","volume-title":"Handbook of Wireless Networks and Mobile Computing","author":"J. Janssen","year":"2002","unstructured":"Janssen, J.: Channel Assignment and Graph Labeling. In: Stojmenovic, I. (ed.) Handbook of Wireless Networks and Mobile Computing, ch. 5, pp. 95\u2013117. John Wiley & Sons, Inc., Chichester (2002)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"Johnson, D.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0021-9800(66)80012-1","volume":"1","author":"D. Kleitman","year":"1966","unstructured":"Kleitman, D.: Families of Non-Disjoint Subsets. Journal of Combinatorial Theory\u00a01, 153\u2013155 (1966)","journal-title":"Journal of Combinatorial Theory"},{"key":"21_CR9","unstructured":"Lu, C.-J.: A Deterministic Approximation Algorithm for a Minimax Integer Programming Problem. In: Proc. of the 10th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 663\u2013668 (1999)"},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the Hardness of Approximating Minimization Problems. Journal of the ACM\u00a041(5), 960\u2013981 (1994)","journal-title":"Journal of the ACM"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/0471224561.ch4","volume-title":"Handbook of Wireless Networks and Mobile Computing","author":"L. Narayanan","year":"2002","unstructured":"Narayanan, L.: Channel Assignment and Graph Multicoloring. In: Stojmenovic, I. (ed.) Handbook of Wireless Networks and Mobile Computing, ch. 4, pp. 71\u201394. John Wiley & Sons, Inc., Chichester (2002)"},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.: Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica\u00a07(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Improved Approximations of Packing and Covering Problems. In: Proc. of the 27th ACM Symposium on Theory of Computing, pp. 268\u2013276 (1995)","DOI":"10.1145\/225058.225138"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:01:53Z","timestamp":1553155313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11533719_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}