J.D. Dunagan, D.A. Spielman, and S-H. Teng. Smoothed analysis of the renegar's condition number for linear programming. In SIAM Conference on Optimization, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Smoothed Analysis of Three Combinatorial Problems - Banderier, Mehlhorn, Beier (2003) (3 citations) (Correct)
....matrix, a right hand side) The smoothing operation adds Gaussian noise with parameter to each number in the input. The expected running time of the simplex algorithm for such a perturbed instance is polynomial in 1= and the number of input variables. The other papers on smoothed analysis [2, 7] also discuss continuous problems. We apply the concept of smoothed analysis to problems de ned on sequences and natural numbers. In both cases we rst de ne a natural model of perturbation and then analyze some algorithms. Partial Permutations: Our rst model applies to problems de ned on ....
J.D. Dunagan, D.A. Spielman, and S-H. Teng. Smoothed analysis of the renegar's condition number for linear programming. In SIAM Conference on Optimization, 2002.
A Simple Polynomial-time Rescaling Algorithm for Solving.. - Dunagan, Vempala (2004) Self-citation (Dunagan) (Correct)
No context found.
J. Dunagan, S. Teng, and D. A. Spielman, Smoothed Analysis of Renegar's Condition Number for Linear Programming, SIAM Conference on Optimization, 2002.
Smoothed Analysis of Three Combinatorial Problems - Banderier, Beier, Mehlhorn (2003) (3 citations) (Correct)
No context found.
J.D. Dunagan, D.A. Spielman, and S-H. Teng. Smoothed analysis of the renegar's condition number for linear programming. In SIAM Conference on Optimization, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC