Pages that link to "Item:Q2777611"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for MAX SAT (Q2777611):
Displayed 8 items.
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT (Q2368971) (← links)
- Adding cardinality constraints to integer programs with applications to maximum satisfiability (Q2380072) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- (Q4637032) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)