Pages that link to "Item:Q1408377"

The following pages link to Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377):

Displaying 25 items.

• A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
• A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
• A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
• Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
• Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) (← links)
• An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
• Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
• Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
• Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
• Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
• A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
• Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
• New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
• An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
• A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
• A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
• New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
• An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
• Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
• A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
• Exact Algorithms for MAX-SAT (Q4916231) (← links)
• MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)