{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:44:03Z","timestamp":1772196243468,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00245-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"235-245","source":"Crossref","is-referenced-by-count":30,"title":["Combinatorial optimization algorithms for radio network planning"],"prefix":"10.1016","volume":"263","author":[{"given":"Patrice","family":"Cal\u00e9gari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Guidec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Kuonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00245-0_BIB1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02570718","article-title":"Almost optimal set covers in finite VC-dimension","volume":"14","author":"Br\u00f6nnimann","year":"1995","journal-title":"Discrete Comput Geometry"},{"issue":"1","key":"10.1016\/S0304-3975(00)00245-0_BIB2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jpdc.1997.1397","article-title":"Parallel island-based genetic algorithm for radio network design","volume":"47","author":"Cal\u00e9gari","year":"1997","journal-title":"J. Parallel Distributed Comput. (JPDC): special issue on Parallel Evolutionary Comput."},{"key":"10.1016\/S0304-3975(00)00245-0_BIB3","doi-asserted-by":"crossref","unstructured":"P. Cal\u00e9gari, P. Kuonen, F. Guidec, D. Wagner, A genetic approach to radio network optimization for mobile systems, Proceedings of the IEEE 47th Vehicular Technology Conference (VTC), Vol. 2, May 1997, pp. 755\u2013759.","DOI":"10.1109\/VETEC.1997.600430"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"3","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(00)00245-0_BIB5","doi-asserted-by":"crossref","unstructured":"R. Duh, M. F\u00fcrer, Approximation of k-set cover by semi-local optimization, Proceedings of the 29th Annual ACM Symposium on Theory Computation, 1997, pp. 256\u2013264.","DOI":"10.1145\/258533.258599"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB6","doi-asserted-by":"crossref","unstructured":"U. Feige, A threshold of logn for approximating set cover, Proceedings of the 28th ACM Symposium on Theory of Computing, 1996.","DOI":"10.1145\/237814.237977"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB7","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB8","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972,, pp. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB9","series-title":"The Computational Complexity Problems","author":"Kearns","year":"1990"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02187833","article-title":"Almost tight bounds for \u03b5-nets","volume":"7","author":"Koml\u00f3s","year":"1992","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB11","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek, Epsilon-nets and computational geometry, in: J. Pach (Ed.), New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics, Vol. 10, Springer, Berlin, 1993,, pp. 69\u201389.","DOI":"10.1007\/978-3-642-58043-7_4"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB12","doi-asserted-by":"crossref","unstructured":"S. Micali, V.V. Vazirani, An O(|E||V|) algorithm for maximum matching in general graphs, Proceedings 21st IEEE Annual Symposium on the Foundations of Computer Science, 1980, pp. 17\u201327.","DOI":"10.1109\/SFCS.1980.12"},{"issue":"2","key":"10.1016\/S0304-3975(00)00245-0_BIB13","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/254180.254190","article-title":"A survey on approximately optimal solution to some covering and packing problems","volume":"29","author":"Paschos","year":"1997","journal-title":"ACM Comput. Surveys"},{"issue":"5","key":"10.1016\/S0304-3975(00)00245-0_BIB14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","article-title":"Improved performance of the greedy algorithm for partial cover","volume":"64","author":"Slav\u0131\u0301k","year":"1997","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(00)00245-0_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/jagm.1997.0887","article-title":"A tight analysis of the greedy algorithm for set cover","volume":"25","author":"Slav\u0131\u0301k","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB16","series-title":"Proceedings of the 3rd International Conference on Genetic Algorithms, George Mason University","first-page":"434","article-title":"Distributed genetic algorithms","author":"Tanese","year":"1989"},{"key":"10.1016\/S0304-3975(00)00245-0_BIB17","unstructured":"D. Whitley, A genetic algorithm tutorial, Technical Report CS-93-103, Colorado State University, 1993."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002450?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002450?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:04Z","timestamp":1578458884000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002450"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00245-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}