Smoothed analysis of algorithms-Reference-Cited by-同舟云学术

Smoothed analysis of algorithms

Published:2004-05 Issue:3 Volume:51 Page:385-463
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Spielman Daniel A.¹,Teng Shang-Hua²

Affiliation:

1. Massachusetts Institute of Technology, Boston, Massachusetts

2. Boston University, Boston, Massachusetts, and Akamai Technologies, Inc., MA

Abstract

We introduce the smoothed analysis of algorithms , which continuously interpolates between the worst-case and average-case analyses of algorithms. In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small random perturbations of that input. We measure this performance in terms of both the input size and the magnitude of the perturbations. We show that the simplex algorithm has smoothed complexity polynomial in the input size and the standard deviation of Gaussian perturbations.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/990308.990310

Reference42 articles.

1. A simplex variant solving an m × d linear program in O(min(m2, d2) expected number of pivot steps

2. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension

3. Amenta N. and Ziegler G. 1999. Deformed products and maximal shadows of polytopes. In Advances in Discrete and Computational Geometry B. Chazelle J. Goodman and R. Pollack Eds. Number 223 in Contemporary Mathematics. American Mathematics Society 57--90. Amenta N. and Ziegler G. 1999. Deformed products and maximal shadows of polytopes. In Advances in Discrete and Computational Geometry B. Chazelle J. Goodman and R. Pollack Eds. Number 223 in Contemporary Mathematics. American Mathematics Society 57--90.

4. Notes on Bland's pivoting rule;Avis D.;Polyhedral Combinatorics. Math. Programming Study,1978

Cited by 472 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Global Convergence of Hessenberg Shifted QR I: Exact Arithmetic;Foundations of Computational Mathematics;2024-08-13

2. Courier routing for a new last-mile logistics service;IISE Transactions;2024-07-25

3. The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability;computational complexity;2024-07-03

4. Smoothed Analysis with Adaptive Adversaries;Journal of the ACM;2024-06-11

5. Smoothed Analysis of Information Spreading in Dynamic Networks;Journal of the ACM;2024-06-11