87 citations · 373 across the 33 of their papers we have counts for
1 paper · 1 filter
Dan Garber, Elad Hazan
Linear optimization is many times algorithmically simpler than non-linear convex optimization. Linear optimization over matroid polytopes, matching polytopes and path polytopes are…