Pages that link to "Item:Q5945919"
From MaRDI portal
The following pages link to Best possible approximation algorithm for MAX SAT with cardinality constraint. (Q5945919):
Displaying 8 items.
- Adding cardinality constraints to integer programs with applications to maximum satisfiability (Q2380072) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
- Algorithms - ESA 2003 (Q5897255) (← links)
- Max-SAT with cardinality constraint parameterized by the number of clauses (Q6547959) (← links)
- On MAX-SAT with cardinality constraint (Q6575388) (← links)
- On MAX-SAT with cardinality constraint (Q6652473) (← links)
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back (Q6664061) (← links)