4 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Amit Deshpande, Rakesh Venkat
Guruswami and Sinop give a O(1/δ) approximation guarantee for the non-uniform Sparsest Cut problem by solving O(r)-level Lasserre semidefinite constraints, provided that the ge…