Smoothed analysis of three combinatorial problems

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

Volumn 2747, Issue , 2003, Pages 198-207

  Banderier, Cyril ^a   Beier, René ^b   Mehlhorn, Kurt ^b  

^a Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

AVERAGE COMPLEXITY; AVERAGE-CASE ANALYSIS; COMBINATORIAL PROBLEM; CONTINUOUS PROBLEMS; DISCRETE PROBLEMS; QUICKSORT; SHORTEST PATH; SMOOTHED ANALYSIS;

ARTIFICIAL INTELLIGENCE;

EID: 35248867876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_14     Document Type: Article

References (14)

1. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan. Faster algorithms for the shortest path problem. J. Assoc. Comput. Mach., 37(2):213-223, 1990.
2. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schäfer, and T. Vredeveld. Smoothening helps: A probabilistic analysis of the Multi-Level Feedback algorithm. submitted, 2003.
3. A. Blum and J.D. Dunagan. Smoothed analysis of the perception algorithm for linear programming. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), pages 905-914. ACM Press, 2002.
4. Boris V. Cherkassky, Andrew V. Goldberg, and Craig Silverstein. Buckets, heaps, lists, and monotone priority queues. SIAM J. Comput., 28(4):1326-1346 (electronic), 1999.
5. 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.
6. Andrew V. Goldberg. A simple shortest path algorithm with linear average time. In Proceedings of the 9th European Symposium on Algorithms (ESA '01), pages 230-241. Springer Lecture Notes in Computer Science LNCS 2161, 2001.
7. Yuri Gurevich. Average case completeness. Journal of Computer and System Sciences, 42(3):346-398, 1991.
8. Twenty-Eighth IEEE Symposium on Foundations of Computer Science (Los Angeles, CA, 1987).
9. Torben Hagerup. Improved shortest paths on the word RAM. In Automata, languages and programming (ICALP 2000), pages 61-72. Springer, Berlin, 2000.
10. Leonid A. Levin. Average case complete problems. SIAM J. Comput., 15(1):285-286, 1986.
11. Ulrich Meyer. Shortest-Paths on arbitrary directed graphs in linear Average-Case time. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 797-806. ACM Press, 2001.
12. Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. Cambridge University Press, Cambridge, 1995.
13. Raman. Recent results on the single-source shortest paths problem. In SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), volume 28, pages 61-72. Springer, Berlin, 1997.
14. Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pages 296-3051, 2001.