Approximation of non-boolean 2CSP

DOI10.1137/1.9781611974331.ch117zbMath1410.68171arXiv1504.00681OpenAlexW2953269844MaRDI QIDQ4575701

Alexandra Kolla, Luca Trevisan, Guy Kindler

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00681

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Approximation algorithms (68W25)

Related Items (4)

Approximating CSPs Using LP Relaxation ⋮ Approximation Algorithms for CSPs ⋮ A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems ⋮ Unnamed Item

This page was built for publication: Approximation of non-boolean 2CSP