1 Hit in 7.1 sec

An 𝒪(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints [article]

Yin Tat Lee, Swati Padmanabhan
2021 arXiv   pre-print
In this paper, we give an algorithm to solve this problem to ε-accuracy, with a run time of 𝒪(m/ε^3.5), where m is the number of non-zero entries in the cost matrix.  ...  As a corollary of our result, given an instance of the Max-Cut problem with n vertices and m ≫ n edges, our algorithm when applied to the standard SDP relaxation of Max-Cut returns a (1 - ε)α_GW cut in  ...  In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1824–1831, 2016. 0.1 [AO15] Zeyuan  ... 
arXiv:1903.01859v2 fatcat:wl4jzbxrrjhk7onzfefrcmpwxu