Pages that link to "Item:Q4314502"
From MaRDI portal
The following pages link to On the Approximation of Maximum Satisfiability (Q4314502):
Displaying 50 items.
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- A fixed point operator for the generalised maximum satisfiability problem (Q689970) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- On the minimum satisfiability problem (Q779212) (← links)
- Simplified tight analysis of Johnson's algorithm (Q834942) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- Alphabet indexing for approximating features of symbols (Q1274598) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Approximating a generalization of MAX 2SAT and MIN 2SAT (Q1841882) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Investigation of maximum and minimum satisfiability problems using \(L\)-partition (Q2487731) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Query-guided maximum satisfiability (Q2828249) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- Partial Satisfaction of k-Satisfiable Formulas (Q3503510) (← links)
- Maximum Constraint Satisfaction on Diamonds (Q3524191) (← links)
- (Q4229151) (← links)
- On Approximation Algorithms for Hierarchical MAX-SAT (Q4377125) (← links)
- (Q4524463) (← links)
- The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
- (Q4993600) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- (Q5365140) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
- On approximability of satisfiable <i>k</i> -CSPs: I (Q6083552) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
