11 citations · 11 across the 1 of their papers we have counts for
2 papers
math.OC2019
An Exponential Lower Bound for Zadeh's pivot rule
Yann Disser, Oliver Friedmann, Alexander V. Hopp
The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, determinist…
cs.GT2009★ 11 cited
A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
Oliver Friedmann
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdziski. First, we informally show which structure…