The following pages link to (Q4229151):
Displaying 24 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Approximating a generalization of MAX 2SAT and MIN 2SAT (Q1841882) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- Approximation algorithms for Max Morse matching (Q2362103) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Simple Approximation Algorithms for Balanced MAX 2SAT (Q2802976) (← links)
- Near-optimal algorithms for maximum constraint satisfaction problems (Q2930257) (← links)
- (Q2934583) (← links)
- (Q4251055) (← links)
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711) (← links)
- On Approximation Algorithms for Hierarchical MAX-SAT (Q4377125) (← links)
- (Q4425953) (← links)
- (Q4524463) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- (Q4900961) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- Complexity and Approximability of Parameterized MAX-CSPs (Q5363783) (← links)
- On Some Recent Approximation Algorithms for MAX SAT (Q5405076) (← links)
- Theory and Applications of Satisfiability Testing (Q5714749) (← links)
- Automata, Languages and Programming (Q5716842) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
