25 citations · 57 across the 24 of their papers we have counts for
4 papers · 1 filter
Lower bounds for ranking-based pivot rules
Yann Disser, Georg Loho, Matthew Maat +1
The existence of a polynomial pivot rule for the simplex method for linear programming, policy iteration for Markov decision processes, and strategy improvement for parity games ea…
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…
Improved Bounds for Open Online Dial-a-Ride on the Line
Alexander Birx, Yann Disser, Kevin Schewior
We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportation requests appear over time and need to be served by a single server. We give a…
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
Alexander Birx, Yann Disser
The online Dial-a-Ride problem is a fundamental online problem in a metric space, where transportation requests appear over time and may be served in any order by a single server w…