How to Round Any CSP
From MaRDI portal
Publication:5171222
DOI10.1109/FOCS.2009.74zbMath1292.90231OpenAlexW2155188403MaRDI QIDQ5171222
Prasad Raghavendra, David Steurer
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2009.74
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Stochastic programming (90C15) Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
Simultaneous Approximation of Constraint Satisfaction Problems ⋮ Nonnegative Weighted #CSP: An Effective Complexity Dichotomy ⋮ Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ Unnamed Item ⋮ Extended formulation for CSP that is compact for instances of bounded treewidth ⋮ The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems ⋮ Iterated linear optimization ⋮ Semidefinite Programming and Constraint Programming ⋮ Approximability Distance in the Space of H-Colourability Problems ⋮ Properties of an Approximability-related Parameter on Circular Complete Graphs ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: How to Round Any CSP
