Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals. 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 ...

• Type: Journal
• Year: 2000
• Where: SIAMCOMP
• Authors: Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
• Keywords: Corresponding Dual Hypergraph, Hypergraph, Partial Transversals, SIAMCOMP 2000