93 citations · 322 across the 31 of their papers we have counts for
Showing 2021Show all
3 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★ 6 cited
A convex form that is not a sum of squares
James Saunderson
Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument. We pro…
math.OC2021★ 2 cited
Hyperbolicity cones are amenable
Bruno F. Lourenço, Vera Roshchina, James Saunderson
Amenability is a notion of facial exposedness for convex cones that is stronger than being facially dual complete (or "nice") which is, in turn, stronger than merely being facially…