Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
From MaRDI portal
Publication:2719122
DOI10.1137/S0097539700370072zbMath0980.68077MaRDI QIDQ2719122
Kazuhisa Makino, Endre Boros, Leonid G. Khachiyan, Vladimir A. Gurvich
Publication date: 21 June 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
hypergraphdualizationindependent settransversaldata miningthreshold functionmonotone Boolean functionincremental polynomial timemaximal frequent setminimal infrequent set
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)
Related Items (18)
Dual-bounded generating problems: Weighted transversals of a hypergraph ⋮ Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data ⋮ An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation ⋮ On Dualization over Distributive Lattices ⋮ Interior and exterior functions of positive Boolean functions. ⋮ Invited talks ⋮ An inequality for polymatroid functions and its applications. ⋮ Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ On enumerating minimal dicuts and strongly connected subgraphs ⋮ Generating dual-bounded hypergraphs ⋮ A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs ⋮ On the complexity of solution extension of optimization problems ⋮ Blockers and transversals ⋮ Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms ⋮ Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)
This page was built for publication: Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
