23 citations · 87 across the 20 of their papers we have counts for
1 paper · 1 filter
Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler +1
We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator…