1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2025
Short circuit walks in fixed dimension
Alexander E. Black, Christian Nöbel, Raphael Steiner
Circuit augmentation schemes are a family of combinatorial algorithms for linear programming that generalize the simplex method. To solve the linear program, they construct a so-ca…
math.OC2024★ 1 cited
Complexity of polytope diameters via perfect matchings
Christian Nöbel, Raphael Steiner
The Circuit diameter of polytopes was introduced by Borgwardt, Finhold and Hemmecke as a fundamental tool for the study of circuit augmentation schemes for linear programming and f…