{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:09:55Z","timestamp":1769839795049,"version":"3.49.0"},"reference-count":34,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00455-9","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:37:32Z","timestamp":1060303052000},"page":"255-281","source":"Crossref","is-referenced-by-count":16,"title":["An inequality for polymatroid functions and its applications"],"prefix":"10.1016","volume":"131","author":[{"given":"E.","family":"Boros","sequence":"first","affiliation":[]},{"given":"K.","family":"Elbassioni","sequence":"additional","affiliation":[]},{"given":"V.","family":"Gurvich","sequence":"additional","affiliation":[]},{"given":"L.","family":"Khachiyan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00455-9_BIB1","series-title":"Advances in Knowledge Discovery and Data Mining","first-page":"307","article-title":"Fast discovery of association rules","author":"Agrawal","year":"1996"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB2","first-page":"5","article-title":"On the number of dead-end independent sets in graphs from hereditary classes","volume":"6","author":"Alekseev","year":"1991","journal-title":"Combin. Algebraic Methods Discrete Optim."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB3","unstructured":"L. Babai, P. Frankl, Linear algebra methods in combinatorics, Manuscript, The University of Chicago, September 1992."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230190206","article-title":"On graphs with polynomially solvable maximal-weight clique problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(87)90131-9","article-title":"An O(mn) time algorithm for regular set-covering problems","volume":"54","author":"Bertolazzi","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1995.1157","article-title":"Complexity of identification and dualization of positive Boolean functions","volume":"123","author":"Bioch","year":"1995","journal-title":"Inform. Comput."},{"issue":"4","key":"10.1016\/S0166-218X(02)00455-9_BIB7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1142\/S0129626400000251","article-title":"An efficient incremental algorithm for generating all maximal independent sets for hypergraphs of bounded dimension","volume":"10","author":"Boros","year":"2000","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB8","series-title":"Automata, Languages and Programming, 28th International Colloquium, ICALP","first-page":"92","article-title":"On generating all minimal integer solutions for a monotone system of linear inequalities","volume":"Vol. 2076","author":"Boros","year":"2001"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB9","series-title":"Automata, Languages and Programming, 27th International Colloquium, ICALP","first-page":"588","article-title":"Generating partial and multiple transversals of a hypergraph","volume":"Vol. 1853","author":"Boros","year":"2000"},{"issue":"6","key":"10.1016\/S0166-218X(02)00455-9_BIB10","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1137\/S0097539700370072","article-title":"Dual bounded generation: partial and multiple transversals of a hypergraph","volume":"30","author":"Boros","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB11","doi-asserted-by":"crossref","unstructured":"E. Boros, V. Gurvich, L. Khachiyan, K. Makino, An inequality limiting the number of maximal frequent sets, In: H. Alt, A. Ferreira (Eds.), Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), Antibes Juan-les-Pins, France, 14\u201316 March 2002, Lecture Notes in Computer Science 2285, Springer, Berlin, 2002, pp. 133\u2013141.","DOI":"10.1007\/3-540-45841-7_10"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB12","unstructured":"E. Boros, V. Gurvich, L. Khachiyan, K. Makino, Generating weighted transversals of a hypergraph, in Proceedings of the 2nd Japanese\u2013Hungarian Symposium on Discrete Mathematics and Its Applications, Hungarian Academy of Sciences, Budapest, Hungary, April 20\u201323, 2001, pp. 13\u201322."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(87)90056-4","article-title":"Dualization of regular Boolean functions","volume":"16","author":"Crama","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB14","doi-asserted-by":"crossref","unstructured":"W. Duckworth, D. Manlove, M. Zito, On the approximability of the maximum induced matching problem, J. Combin. Optim., to appear.","DOI":"10.1016\/j.jda.2004.05.001"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB15","series-title":"Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia","first-page":"323","article-title":"Subtractive reductions and complete problems for counting complexity classes","volume":"Vol. 1893","author":"Durand","year":"2000"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB16","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1006\/jagm.1996.0062","article-title":"On the complexity of dualization of monotone disjunctive normal forms","volume":"21","author":"Fredman","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","article-title":"On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions","volume":"96\u201397","author":"Gurvich","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB18","series-title":"Hypergraph Seminar","first-page":"191","article-title":"Aspects of the theory of hypermatroids","volume":"Vol. 411","author":"Helgason","year":"1975"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB21","doi-asserted-by":"crossref","unstructured":"R. Karp, M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, in: Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 56\u201364.","DOI":"10.1109\/SFCS.1983.35"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB22","doi-asserted-by":"crossref","unstructured":"L. Khachiyan, Transversal hypergraphs and families of polyhedral cones, in: P. Pardalos (Eds.), Advances in Convex Analysis and Global Optimization, Proceedings of the International Conference Honoring to the Memory of K. Carath\u00e9odory, Samos, Greece, June 2000, Kluwer, Dordrecht, 2001.","DOI":"10.1007\/978-1-4613-0279-7_5"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB23","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0209042","article-title":"Generating all maximal independent sets","volume":"9","author":"Lawler","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB24","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, Submodular functions and convexity, in: A. Bachem, M. Gr\u00f6tschel, B. Korte (Eds.), Mathematical Programming: The State of the Art, Bonn 1982, Springer, Berlin, 1983, pp. 235\u2013257.","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB25","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0166-218X(95)00092-6","article-title":"Interior and exterior functions of Boolean functions","volume":"69","author":"Makino","year":"1996","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"10.1016\/S0166-218X(02)00455-9_BIB26","first-page":"307","article-title":"Inner-core and outer-core functions of partially defined Boolean functions","volume":"96\u201397","author":"Makino","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB27","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1017\/S0305004100051677","article-title":"Rado's theorem for polymatroids","volume":"78","author":"McDiarmid","year":"1975","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB28","unstructured":"B. Morris, A. Sinclair, Random walks on truncated cubes and sampling 0-1 knapsack problem. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999, pp. 230\u2013240."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB29","unstructured":"E. Prisner, Graphs with few cliques, Graph Theory, Combinatorics and Algorithms, Vols. 1, 2 (Kalamazoo, MI, 1992) Wisley-Interscience, Wisley, New York, 1995, pp. 945\u2013956."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB30","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","article-title":"Bounds on backtrack algorithms for listing cycles, paths, and spanning trees","volume":"5","author":"Read","year":"1975","journal-title":"Networks"},{"issue":"1","key":"10.1016\/S0166-218X(02)00455-9_BIB31","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","article-title":"NP-completeness of some generalizations of the maximum matching problem","volume":"15","author":"Stockmeyer","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB32","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00455-9_BIB33","series-title":"Matroid Theory","author":"Welsch","year":"1976"},{"key":"10.1016\/S0166-218X(02)00455-9_BIB34","doi-asserted-by":"crossref","unstructured":"K. Diks, W. Rytter (Eds.), Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, Lecture Notes in Computer Science 2420, Springer, Berlin, 2002, pp. 143\u2013154.","DOI":"10.1007\/3-540-45687-2"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T05:10:48Z","timestamp":1585113048000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004559"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00455-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}