Approximating CSPs Using LP Relaxation

DOI10.1007/978-3-662-47672-7_67zbMath1440.68103MaRDI QIDQ3448840

Subhash A. Khot, Rishi Saket

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_67

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms