Smoothed Analysis of Termination of Linear Programming Algorithms
by
Daniel A. Spielman, et al.
| Citations: | 12 - 2 self |
BibTeX
@MISC{Spielman_smoothedanalysis,
author = {Daniel A. Spielman and et al.},
title = { Smoothed Analysis of Termination of Linear Programming Algorithms},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We perform a smoothed analysis of a termination phase for linear programming algorithms. By combining this analysis with the smoothed analysis of Renegar’s condition number by Dunagan, Spielman and Teng
