{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:22:54Z","timestamp":1737436974566,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754879"},{"type":"electronic","value":"9783540754886"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75488-6_8","type":"book-chapter","created":{"date-parts":[[2007,8,31]],"date-time":"2007-08-31T11:13:45Z","timestamp":1188558825000},"page":"68-77","source":"Crossref","is-referenced-by-count":4,"title":["On Approximating Minimum Infrequent and Maximum Frequent Sets"],"prefix":"10.1007","author":[{"given":"Mario","family":"Boley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Gionis, A., Mannila, H.: Approximating a collection of frequent sets. In: ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (2004)","DOI":"10.1145\/1014052.1014057"},{"key":"8_CR2","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MIT Press, Cambridge (1996)"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01277956","volume":"5","author":"N. Alon","year":"1995","unstructured":"Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Computational Complexity\u00a05(1), 60\u201375 (1995)","journal-title":"Computational Complexity"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: SIGMOD Conference, pp. 265\u2013276 (1997)","DOI":"10.1145\/253262.253327"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cornuejols, G., Fisher, M., Nemhauser, G.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science\u00a0(23), 789\u2013810 (1977)","DOI":"10.1287\/mnsc.23.8.789"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: KDD, pp. 43\u201352 (1999)","DOI":"10.1145\/312129.312191"},{"issue":"4","key":"8_CR8","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"},{"key":"8_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979), ISBN 0-7167-1044-7"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D. Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharm, R.S.: Discovering all most specific sentences. ACM Trans. Database Syst.\u00a028(2), 140\u2013174 (2003)","journal-title":"ACM Trans. Database Syst."},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. Comput.\u00a018(6), 1149\u20131178 (1989)","journal-title":"SIAM J. Comput."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Khot, S.: Ruling out ptas for graph min-bisection, densest subgraph and bipartite clique. In: FOCS, pp. 136\u2013145 (2004)","DOI":"10.1109\/FOCS.2004.59"},{"key":"8_CR13","volume-title":"ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"F. Pan","year":"2003","unstructured":"Pan, F., Cong, G., Tung, A.K.H., Yang, J., Zaki, M.J.: Carpenter: Finding closed patterns in long biological datasets. In: ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, ACM Press, New York (2003)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/jagm.1997.0887","volume":"25","author":"P. Slav\u00edk","year":"1997","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. Journal of Algorithms\u00a025, 237\u2013254 (1997)","journal-title":"Journal of Algorithms"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75488-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T19:37:24Z","timestamp":1737401844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75488-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540754879","9783540754886"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75488-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}