research
∙
03/02/2020
Efficient algorithms for the Potts model on small-set expanders
We develop an approximation algorithm for the partition function of the ...
share
research
∙
10/23/2018
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs
In this paper we study the problem of finding large cuts in K_r-free gra...
research
∙
07/16/2018
Improving the smoothed complexity of FLIP for max cut problems
Finding locally optimal solutions for max-cut and max-k-cut are well-kno...
research
∙
12/29/2017
