{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:59Z","timestamp":1725889919900},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380443"},{"type":"electronic","value":"9783540380450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_8","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T08:33:54Z","timestamp":1156494834000},"page":"61-69","source":"Crossref","is-referenced-by-count":2,"title":["Tight Results on Minimum Entropy Set Cover"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","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. Inform. Theory\u00a042(5), 1329\u20131339 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/11602613_82","volume-title":"Algorithms and Computation","author":"J. Cardinal","year":"2005","unstructured":"Cardinal, J., Fiorini, S., Joret, G.: Minimum entropy coloring. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 819\u2013828. Springer, Heidelberg (2005)"},{"issue":"4","key":"8_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. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","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. System Sci.\u00a057(2), 187\u2013199 (1998); Complexity 96\u2014The Eleventh Annual IEEE Conference on Computational Complexity, Philadelphia, PA","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","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\u00a040(4), 219\u2013234 (2004)","journal-title":"Algorithmica"},{"key":"8_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, 3rd edn., vol.\u00a0I. John Wiley & Sons Inc., New York (1968)","edition":"3"},{"key":"8_CR7","series-title":"Algorithms and Combinatorics","volume-title":"Geometric algorithms and combinatorial optimization","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A. (eds.): Geometric algorithms and combinatorial optimization, 2nd edn. Algorithms and Combinatorics, vol.\u00a02. Springer, Berlin (1993)","edition":"2"},{"issue":"2-3","key":"8_CR8","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0348(2-3), 240\u2013250 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"#cr-split#-8_CR9.1","unstructured":"Hardy, G.H., Littlewood, J.E., P??lya, G.: Inequalities. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1988);"},{"key":"#cr-split#-8_CR9.2","unstructured":"Reprint of the 1952 edition"},{"issue":"2","key":"8_CR10","first-page":"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. Japan\u00a044(2), 194\u2013204 (2001)","journal-title":"J. Oper. Res. Soc. Japan"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11830924_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:41Z","timestamp":1619493221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11830924_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}