Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.

Daniel A. Spielman Shang-Hua Teng

Published in: J. ACM (2004)

Keyphrases

simplex algorithm
computational complexity
learning algorithm
linear programming
worst case
optimization problems
computationally intensive
simplex method
image restoration
linear program
combinatorial optimization
network simplex algorithm