Pages that link to "Item:Q1095668"

The following pages link to An O(m n) algorithm for regular set-covering problems (Q1095668):

Displaying 22 items.

• Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
• Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
• On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
• An algorithm for the difference between set covers (Q944712) (← links)
• Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
• FCV\(_1\): A new fast greedy covering algorithm (Q1130177) (← links)
• A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
• An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236) (← links)
• An inequality for polymatroid functions and its applications. (Q1410680) (← links)
• On the complexity of asymptotically optimal coverings and packings (Q1594186) (← links)
• Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
• Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
• Boolean minors (Q1894774) (← links)
• A special case of set covering problems (Q1908929) (← links)
• Interior and exterior functions of Boolean functions (Q1923581) (← links)
• The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
• Reoptimization of set covering problems (Q2247803) (← links)
• Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
• Unique key Horn functions (Q2672584) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
• Generating dual-bounded hypergraphs (Q4405941) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)