Smoothed analysis of algorithms
Top Cited Papers
- 1 May 2004
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 51 (3) , 385-463
- https://doi.org/10.1145/990308.990310
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Deformed products and maximal shadows of polytopesPublished by American Mathematical Society (AMS) ,1999
- Coloring Random and Semi-Random k-Colorable GraphsJournal of Algorithms, 1995
- SOME APPLICATIONS OF THE RANK REVEALING QR FACTORIZATIONSIAM Journal on Scientific and Statistical Computing, 1992
- A quasi-polynomial bound for the diameter\\of graphs of polyhedraBulletin of the American Mathematical Society, 1992
- A simplex variant solving an m × d linear program in O(min(m2, d2) expected number of pivot stepsJournal of Complexity, 1987
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimensionJournal of the ACM, 1985
- Worst case behavior of the steepest edge simplex methodDiscrete Applied Mathematics, 1979
- Notes on Bland’s pivoting rulePublished by Springer Nature ,1978
- The simplex algorithm with the pivot rule of maximizing criterion improvementDiscrete Mathematics, 1973
- The convex hull of a random set of pointsBiometrika, 1965