Near-optimal algorithms for maximum constraint satisfaction problems
From MaRDI portal
Publication:2930257
DOI10.1145/1541885.1541893zbMath1298.68111OpenAlexW2621263703MaRDI QIDQ2930257
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1541885.1541893
No records found.
No records found.
Related Items (10)
Designing FPT Algorithms for Cut Problems Using Randomized Contractions ⋮ The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ Approximation Algorithms for CSPs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs ⋮ Semidefinite Programming and Constraint Programming ⋮ Robustly Solvable Constraint Satisfaction Problems ⋮ Black-Box Reductions in Mechanism Design ⋮ The Quest for Strong Inapproximability Results with Perfect Completeness
This page was built for publication: Near-optimal algorithms for maximum constraint satisfaction problems
