Smoothed analysis motivation and discrete models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2748, Issue , 2003, Pages 256-270

  Spielman, Daniel A ^a   Teng, Shang Hua ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; MOTIVATION;

COMPLEXITY OF ALGORITHM; DISCRETE ALGORITHMS; DISCRETE MODELS; GRAPH PROPERTIES; RANDOM NOISE; SIMPLEX ALGORITHM; SMOOTHED ANALYSIS;

ALGORITHMS;

EID: 35248886169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_23     Document Type: Article

References (31)

1. N. Alon, S. Dar, M. Parnas, and D. Ron. Testing of clustering. In 41st Annual Symposium on Foundations of Computer Science, pages 240-250. IEEE, 2000.
2. N. Alon, M. Krivelevich, E. Fischer, and M. Szegedy. Efficient testing of large graphs. In 40th Annual Symposium on Foundations of Computer Science, pages 656-666. IEEE, 1999.
3. N. Alon. Testing subgraphs in large graphs. In IEEE, editor, Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science: proceedings, pages 434-439, 2001.
4. Avrim Blum and John Dunagan. Smoothed analysis of the perceptron algorithm for linear programming. In Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA-02), pages 905-914. ACM Press, 2002.
5. P. Bose and P. Morin. Testing the quality of manufactured disks and cylinders. In ISAAC: 9th International Symposium on Algorithms and Computation, volume 1533 of Lecture Notes in Computer Science, pages 129-138, 1998.
6. Prosenjit Bose and Pat Morin. Testing the quality of manufactured balls. In Workshop on Algorithms and Data Structures, pages 145-156, 1999.
7. Ravi Boppana. Eigenvalues and graph bisection: An average-case analysis. In Proceedings of the 28th Symposium on Foundation of Computer Science, pages 280-285, 1987.
8. Michael A. Bender and Dana Ron. Testing acyclicity of directed graphs in sublinear time. In Automata, Languages and Programming, pages 809-820, 2000.
9. Avrim Blum and Joel Spencer. Coloring random and semi-random k-colorable graphs. J. Algorithms, 19(2):204-234, 1995.
10. Amin Coja-Oghlan. Finding sparse induced subgraphs of semirandom graphs. In Randomization and Approximation Techniques in Computer Science, 2002, volume 2483 of Lecture Notes in Computer Science, pages 139-148. Springer, 2002.
11. A. Czumaj and C. Sohler. Property testing with geometric queries. In Proceedings of the 9th Annual European Symposium on Algorithms, volume 2161 of Lecture Notes in Computer Science, pages 266-277. Springer-Verlag, 2001.
12. A. Czumaj and C. Sohler. Abstract combinatorial programs and efficient property testers. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 83-92, 2002.
13. Artur Czumaj, Christian Sohler, and Martin Ziegler. Property testing in computational geometry. In European Symposium on Algorithms, pages 155-166, 2000.
14. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky. Improved testing algorithms for monotonocity. In Proceedings of RANDOM, pages 97-108, 1999.
15. John Dunagan, Daniel A. Spielman, and Shang-Hua Teng. Smoothed analysis of interior point methods: Condition numbers, available at http://arxiv.org/abs/cs.DS/0302011, 2002.
16. Funda Ergun, Sampath Kannan, S. Ravi Kumar, Ronitt Rubinfeld, and Mahesh Viswanathan. Spot-checkers. In ACM Symposium on Theory of Computing, pages 259-268, 1998.
17. U. Feige and J. Kilian. Heuristics for finding large independent sets, with applications to coloring semi-random graphs. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 674-683. IEEE, 1998.
18. Uri Feige and Robert Krauthgamer. Improved performance guarantees for bandwidth minimization heuristics. Unpublished manuscript, 1998.
19. Oded Goldreich, Shafi Goldwasser, Eric Lehman, and Dana Ron. Testing monotonicity. In IEEE Symposium on Foundations of Computer Science, pages 426-435, 1998.
20. Oded Goldreich, Shari Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, July 1998.
21. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 406-415, 1997.
22. Oded Goldreich and Dana Ron. A sublinear bipartiteness tester for bounded degree graphs. In ACM, editor, Proceedings of the thirtieth annual ACM Symposium on Theory of Computing, pages 289-298. ACM Press, 1998.
23. O. Goldreich and L. Trevisan. Three theorems regarding testing graph properties. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 460-469, 2001.
24. Michael Kearns and Dana Ron. Testing problems with sublearning sample complexity. J. of Comput. Syst. Sci., 61(3):428-456, December 2000.
25. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1997.
26. Michal Parnas and Dana Ron. Testing the diameter of graphs. In Random Structures and Algorithms, volume 1671 of Lecture Notes in Computer Science, pages 85-96, 1999.
27. D. Ron. Property testing. In Handbook on Randomized Computing (Vol. II). Kluwer Academic Publishers, 2001.
28. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, April 1996.
29. Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC '01), pages 296-305, 2001.
30. Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of algorithms. In Proceedings of the International Congress of Mathematicians, volume 1, 2002. to appear.
31. Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of termination of linear programming algorithms. Mathematical Programming B, 2003. to appear.