The work derives tighter bounds on the expected shadow-edge count for a randomized simplex method on perturbed polytopes and raises the algorithm's success probability above the Kelner-Spielman baseline.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
The work derives tighter bounds on the expected shadow-edge count for a randomized simplex method on perturbed polytopes and raises the algorithm's success probability above the Kelner-Spielman baseline.