{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:42:59Z","timestamp":1787503379781,"version":"build-2736575974"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,13]],"date-time":"2007-10-13T00:00:00Z","timestamp":1192233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s00453-007-9076-8","type":"journal-article","created":{"date-parts":[[2007,10,12]],"date-time":"2007-10-12T13:18:54Z","timestamp":1192195134000},"page":"49-60","source":"Crossref","is-referenced-by-count":23,"title":["Tight Results on Minimum Entropy Set Cover"],"prefix":"10.1007","volume":"51","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,10,13]]},"reference":[{"issue":"5","key":"9076_CR1","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1109\/18.532875","volume":"42","author":"N. Alon","year":"1996","unstructured":"Alon, N., Orlitsky, A.: Source coding and graph entropies. IEEE Trans. Inf. Theory 42(5), 1329\u20131339 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9076_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1007\/11602613_82","volume-title":"Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC 2005)","author":"J. Cardinal","year":"2005","unstructured":"Cardinal, J., Fiorini, S., Joret, G.: Minimum entropy coloring. In: Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC 2005). Lecture Notes in Computer Science, vol.\u00a03827, pp. 819\u2013828. Springer, Berlin (2005)"},{"issue":"4","key":"9076_CR3","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln\u2009n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"9076_CR4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57(2), 187\u2013199 (1998). Complexity 96\u2014The 11th Annual IEEE Conference on Computational Complexity, Philadelphia","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9076_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U. Feige","year":"2004","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating min sum set cover. Algorithmica 40(4), 219\u2013234 (2004)","journal-title":"Algorithmica"},{"key":"9076_CR6","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications. vol.\u00a0I, 3rd edn. Wiley, New York (1968)","edition":"3"},{"key":"9076_CR7","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol.\u00a02, 2nd\u00a0edn. Springer, Berlin (1993)","edition":"2"},{"issue":"2-3","key":"9076_CR8","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.tcs.2005.09.015","volume":"348","author":"E. Halperin","year":"2005","unstructured":"Halperin, E., Karp, R.M.: The minimum-entropy set cover problem. Theor. Comput. Sci. 348(2-3), 240\u2013250 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9076_CR9","series-title":"Cambridge Mathematical Library","volume-title":"Inequalities","author":"G.H. Hardy","year":"1988","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1988). Reprint of the 1952 edition"},{"issue":"2","key":"9076_CR10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.15807\/jorsj.44.194","volume":"44","author":"D. Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weight stable set of a claw-free graph. J. Oper. Res. Soc. Jpn. 44(2), 194\u2013204 (2001)","journal-title":"J. Oper. Res. Soc. Jpn."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9076-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9076-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9076-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:00Z","timestamp":1559123100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9076-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,13]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9076"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9076-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,13]]}}}