Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems

DOI10.1137/1.9781611975994.52MaRDI QIDQ5146823zbMATH OpenOpenAlexFDO

Authors Sepehr Abbasi-Zadeh, N. Bansal, Guru Prashanth Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh

Publication date 2 February 2021

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
• scientific article; zbMATH DE number 1754595
• The RPR2 rounding technique for semidefinite programs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Fast SDP algorithms for constraint satisfaction problems

Cited in

(1)

• Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems

This page was built for publication: Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146823)