Pages that link to "Item:Q4317711"
From MaRDI portal
The following pages link to New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711):
Displayed 46 items.
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Pricing commodities (Q627117) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- An 0. 828-approximation algorithm for the uncapacitated facility location problem (Q1296569) (← links)
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem (Q1604042) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- On the lower bounds of random Max 3 and 4-SAT (Q1752631) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← 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)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← 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)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- Improved approximation of maximum vertex cover (Q2583713) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- On the Lower Bounds of Random Max 3 and 4-SAT (Q4632196) (← links)
- (Q4637032) (← links)
- (Q5053241) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6113841) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)