2 citations · 2 across the 5 of their papers we have counts for
1 paper · 2 filters
Gregory Schwartzman
We bound the smoothed running time of the FLIP algorithm for local Max-Cut as a function of α, the arboricity of the input graph. We show that, with high probability and in expec…