Pages that link to "Item:Q2777611"

The following pages link to Improved approximation algorithms for MAX SAT (Q2777611):

Displaying 25 items.

• Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
• Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
• Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
• Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
• The labeled perfect matching in bipartite graphs (Q1044711) (← links)
• Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
• Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
• Approximating MIN 2-SAT and MIN 3-SAT (Q1780843) (← links)
• Improved approximations for max set splitting and max NAE SAT (Q1878408) (← 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 Min-Max selecting items problem (Q2445242) (← links)
• (Q2728900) (← links)
• Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
• Improvements to Hybrid Incremental SAT Algorithms (Q3502706) (← links)
• (Q4229151) (← links)
• On Approximation Algorithms for Hierarchical MAX-SAT (Q4377125) (← links)
• (Q4425953) (← links)
• (Q4524463) (← links)
• (Q4637032) (← links)
• On Some Recent Approximation Algorithms for MAX SAT (Q5405076) (← links)
• Fundamentals of Computation Theory (Q5900781) (← links)
• MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
• An approximation algorithm for MAX 3-SAT (Q6487958) (← links)