Pages that link to "Item:Q2930257"

The following pages link to Near-optimal algorithms for maximum constraint satisfaction problems (Q2930257):

Displaying 24 items.

• A combinatorial algorithm for MAX CSP (Q1007550) (← links)
• On bounded occurrence constraint satisfaction (Q1607037) (← links)
• An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
• Solving RCPSP/max by lazy clause generation (Q2434317) (← links)
• The approximability of constraint satisfaction problems (Q2706139) (← links)
• Semidefinite Programming and Constraint Programming (Q2802541) (← links)
• Robustly solvable constraint satisfaction problems (Q2817797) (← links)
• (Q2934583) (← links)
• Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra (Q2957877) (← links)
• Approximation algorithms for unique games (Q3002794) (← links)
• Black-Box Reductions in Mechanism Design (Q3088099) (← links)
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
• Maximum Constraint Satisfaction on Diamonds (Q3524191) (← links)
• (Q4250183) (← links)
• From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111) (← links)
• Near-Optimal UGC-hardness of Approximating Max k-CSP_R (Q4636446) (← links)
• Approximation Algorithms for CSPs (Q4993604) (← links)
• The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
• Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
• Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313018) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Automata, Languages and Programming (Q5466451) (← links)
• The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)