19 citations · 19 across the 1 of their papers we have counts for
1 paper · 1 filter
Bernd Gärtner, Volker Kaibel
We prove that the Random-Edge simplex algorithm requires an expected number of at most 13n/sqrt(d) pivot steps on any simple d-polytope with n vertices. This is the first nontrivia…