1 citations · 1 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021
Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering
Nimita Shinde, Vishnu Narayanan, James Saunderson
Max-k-Cut and correlation clustering are fundamental graph partitioning problems. For a graph with G=(V,E) with n vertices, the methods with the best approximation guarantees for M…
math.OC2021
On the quality of the PSD closure approximation
Avinash Bhardwaj, Harshit Kothari, Vishnu Narayanan
Postive semidefinite (PSD) cone is the cone of positive semidefinite matrices, and is the object of interest in semidefinite programming (SDP). A computational efficient approximat…