{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:39Z","timestamp":1781077719814,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4580,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0304-3975(99)00130-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:32:23Z","timestamp":1027593143000},"page":"179-200","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":49,"title":["Generalized submodular cover problems and applications"],"prefix":"10.1016","volume":"250","author":[{"given":"Judit","family":"Bar-Ilan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00130-9_BIB1","doi-asserted-by":"crossref","unstructured":"A. Bookstein, S.T. Klein, Construction of optimal graphs for bit-vector compression, Proc. 13th ACM SIGIR Conf. 1990, pp. 327\u2013342.","DOI":"10.1145\/96749.98236"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB2","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0306-4379(91)90030-D","article-title":"Compression of correlated bit-vectors","volume":"16","author":"Bookstein","year":"1991","journal-title":"Inform. Systems"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jagm.1993.1047","article-title":"How to allocate network centers","volume":"15","author":"Bar-Ilan","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00130-9_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":"4","author":"Chvatal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB5","unstructured":"P. Crescenzi, V. Kann, A compendium of NP optimization problems, Technical report, Royal Institute of Technology, Stockholm, Sweden, 1998. http:\/\/www.nada.kth.se\/\u00a0\u0303viggo\/problemlist\/compendium.html."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/moor.7.4.515","article-title":"Worst case analysis of greedy heuristics for integer programming with nonnegative data","volume":"7","author":"Dobson","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB7","doi-asserted-by":"crossref","unstructured":"U. Feige, A threshold of lnn for approximating set cover, Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 314\u2013318.","DOI":"10.1145\/237814.237977"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB8","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Fransisco, 1979."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB9","series-title":"Graphs and Algorithms","author":"Gondran","year":"1984"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB10","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01581035","article-title":"Heuristics for the fixed cost median problem","volume":"22","author":"Hochbaum","year":"1982","journal-title":"Math. Programming"},{"issue":"3","key":"10.1016\/S0304-3975(99)00130-9_BIB11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","article-title":"A unified approach to approximation algorithms for bottleneck problems","volume":"33","author":"Hochbaum","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB13","unstructured":"G. Kortsarz, D. Peleg, Approximating shallow-light trees, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 173\u2013182."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB14","unstructured":"M.R. Korupolu, C.G. Plaxton, R. Rajaraman, Analysis of local search heuristics for facility location problems, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 1\u201310."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)00130-9_BIB16","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of approximating minimization problems","volume":"41","author":"Lund","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB17","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB18","doi-asserted-by":"crossref","unstructured":"R. Raz, S. Safra, A sub constant error probability low degree test, and a sub constant error probability PCP characterization of NP, Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 475\u2013484. 1997.","DOI":"10.1145\/258533.258641"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB19","doi-asserted-by":"crossref","unstructured":"D.B. Shmoys, E. Tardos, K. Aardal, Approximation algorithms for facility location problems, Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 265\u2013274.","DOI":"10.1145\/258533.258600"},{"key":"10.1016\/S0304-3975(99)00130-9_BIB20","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","article-title":"An analysis of the greedy algorithm for the submodular set covering problem","volume":"2","author":"Wolsey","year":"1982","journal-title":"Combinatorica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001309?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:04Z","timestamp":1759625524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0304397599001309"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00130-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized submodular cover problems and applications","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(99)00130-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}