Pages that link to "Item:Q2427689"

The following pages link to Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689):

Displaying 23 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)
• A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
• A combinatorial algorithm for MAX CSP (Q1007550) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
• A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
• New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)
• Design, implementation, and analysis of maximum transversal algorithms (Q2989152) (← links)
• $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
• New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
• Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
• Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
• A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
• (Q4578331) (← links)
• Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
• Counting problems in parameterized complexity (Q5009461) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900948) (← links)
• A modeling and computational study of the frustration index in signed networks (Q6068535) (← links)
• Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings (Q6081567) (← links)