Pages that link to "Item:Q4317711"

The following pages link to New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711):

Displayed 17 items.

• Pricing commodities (Q627117) ‎ (← 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)
• 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 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 of maximum vertex cover (Q2583713) ‎ (← links)