Polynomial-time algorithms for regular set-covering and threshold synthesis
From MaRDI portal
(Redirected from Publication:1089348)
Recommendations
- An O(m n) algorithm for regular set-covering problems
- A Class of Polynomially Solvable Set-Covering Problems
- Algorithms and Computation
- A pretty complete combinatorial algorithm for the threshold synthesis problem
- Complexity and approximability of the cover polynomial
- Exact algorithms for set multicover and multiset multicover problems
- The set covering problem: Complexity, algorithms, experiments
- Algorithms for the set covering problem
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
- Sublinear circuits for polyhedral sets
Cites work
- scientific article; zbMATH DE number 3743175 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3329024 (Why is no real title available?)
- scientific article; zbMATH DE number 3085175 (Why is no real title available?)
- A characterization of threshold matroids
- A new polynomial-time algorithm for linear programming
- An Algorithm to Dualize a Regular Switching Function
- Bottleneck extrema
- Coefficient reduction for inequalities in 0–1 variables
- Faces for a linear inequality in 0–1 variables
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- On the unimodality of some partition polynomials
- Regular (2, 2)-systems
- Solution of Two Difficult Combinatorial Problems with Linear Algebra
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
Cited in
(32)- Counting and enumerating aggregate classifiers
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Simple games versus weighted voting games: bounding the critical threshold value
- Monotone clutters
- On the complexity of problems on simple games
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Linear separation of connected dominating sets in graphs
- The threshold order of a Boolean function
- Sets uniquely determined by projections on axes. II: Discrete case
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- On the characterization of weighted simple games
- Tree-shellability of Boolean functions
- Boolean minors
- A special case of set covering problems
- Decompositions of positive self-dual Boolean functions
- Trading transforms of non-weighted simple games and integer weights of weighted simple games
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Decomposing 1-Sperner hypergraphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- On the complexity of the decisive problem in simple and weighted games
- On minimum sum representations for weighted voting games
- Joint realizability of monotone Boolean functions
- Computational aspects of monotone dualization: a brief survey
- Generating dual-bounded hypergraphs
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
- On the geometric separability of Boolean functions
- Dualization of regular Boolean functions
- A note on the growth of the dimension in complete simple games
- An O(nm)-time algorithm for computing the dual of a regular Boolean function
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- Forms of representation for simple games: sizes, conversions and equivalences
- An O(m n) algorithm for regular set-covering problems
This page was built for publication: Polynomial-time algorithms for regular set-covering and threshold synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089348)
