New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Matroid Intersections, Polymatroid Inequalities, and Related Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
An Algorithm for Dualization in Products of Lattices and Its Applications
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
Annals of Mathematics and Artificial Intelligence
Interior and exterior functions of positive Boolean functions
Discrete Applied Mathematics
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Scientific contributions of Leo Khachiyan (a short overview)
Discrete Applied Mathematics
An intersection inequality for discrete distributions and related generation problems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
We consider two generalizations of the notion of transversal to a finite hypergraph, the so-called multiple and partial transversals. Multiple transversals naturally arise in 0-1 programming, while partial transversals are related to data mining and machine learning. We show that for an arbitrary hypergraph the families of multiple and partial transversals are both dual-bounded in the sense that the size of the corresponding dual hypergraph is bounded by a polynomial in the cardinality and the length of description of the input hypergraph. Our bounds are based on new inequalities of extremal set theory and threshold Boolean logic, which may be of independent interest. We also show that the problems of generating all multiple and all partial transversals for a given hypergraph are polynomial-time reducible to the generation of all ordinary transversals for another hypergraph, i.e., to the well-known dualization problem for hypergraphs. As a corollary, we obtain incremental quasi-polynomial-time algorithms for both of the above problems, as well as for the generation of all the minimal binary solutions for an arbitrary monotone system of linear inequalities.