Towards a Characterization of Constant-Factor Approximable Min CSPs
From MaRDI portal
Publication:5362995
DOI10.1137/1.9781611973730.58zbMath1371.90116OpenAlexW4256040681MaRDI QIDQ5362995
Rajsekar Manokaran, Andrei A. Krokhin, Victor Dalmau
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.58
Related Items
Approximating CSPs Using LP Relaxation ⋮ Sherali-Adams Relaxations for Valued CSPs ⋮ The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ Unnamed Item ⋮ Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs ⋮ The Power of Linear Programming for General-Valued CSPs
This page was built for publication: Towards a Characterization of Constant-Factor Approximable Min CSPs