Pages that link to "Item:Q1307701"
From MaRDI portal
The following pages link to Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701):
Displaying 10 items.
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Simplified tight analysis of Johnson's algorithm (Q834942) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)