{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:21Z","timestamp":1794381081322,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_62","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"733-744","source":"Crossref","is-referenced-by-count":9,"title":["The Minimum-Entropy Set Cover Problem"],"prefix":"10.1007","author":[{"given":"Eran","family":"Halperin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard M.","family":"Karp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"62_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, 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"62_CR2","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"Uriel Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045 (1998)","journal-title":"Journal of the ACM"},{"key":"62_CR3","volume-title":"Inequalities","author":"G.H. Hardy","year":"1934","unstructured":"Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities. Cambridge University Press, Cambridge (1934)"},{"key":"62_CR4","unstructured":"Herskovits, E.H., Cooper, G.F.: Kutato: an entropy-driven system for construction of probabilistic expert systems from database. In: Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, pp. 54\u201362 (1990)"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. In: Proceedings of the 25rd Annual ACM Symposium on Theory of Computing, San Diego, California, pp. 286\u2013293 (1993)","DOI":"10.1145\/167088.167172"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Ran Raz and Shmuel Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Roberts, S., Everson, R., Rezek, I.: Minimum entropy data partitioning. In: Proc. of 9th International Conference on Articial Neural Networks, pp. 844\u2013849 (1999)","DOI":"10.1049\/cp:19991217"},{"issue":"8","key":"62_CR8","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/34.946994","volume":"23","author":"S.J. Roberts","year":"2001","unstructured":"Roberts, S.J., Holmes, C., Denison, D.: Minimum-entropy data partitioning using reversible jump markov chain monte carlo. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023(8), 909\u2013914 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"62_CR9","unstructured":"Sharan, R.: Personal communication (2003)"},{"issue":"1","key":"62_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1007324100110","volume":"26","author":"Y. Xiang","year":"1997","unstructured":"Xiang, Y., Michael Wong, S.K., Cercone, N.: A \u201cmicroscopic\u201d study of minimum entropy search in learning decomposable markov networks. Machine Learning\u00a026(1), 65\u201392 (1997)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:02Z","timestamp":1605741842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_62","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}