Typical properties of winners and losers in discrete optimization

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 343-352

  Beier, Rene ^a   Vöcking, Berthold ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Average case analysis; Optimization problems; Smoothed analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LINEAR PROGRAMMING; NUMBER THEORY; OPTIMIZATION; PERTURBATION TECHNIQUES; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SCHEDULING; THEOREM PROVING;

AVERAGE-CASE ANALYSIS; NETWORK DESIGNS; OPTIMIZATION PROBLEMS; SMOOTHED ANALYSIS;

PROBLEM SOLVING;

EID: 4544343820     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007409     Document Type: Conference Paper

References (25)

1. C. Banderier, R. Beier and K. Mehlhorn. Smoothed Analysis of three combinatorial problems. Proc. 28th Intern. Symp, on Math. Foundations of Computer Science, 198-207, 2003.
2. A. Blum and J. Dunagan. Smoothed Analysis of the Perceptron Algorithm. Proc. of the 13th Annual ACM-SIAM Symp. on Discrete Algorithms, 905-914, 2003.
3. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schäfer and T. Vredeveld. Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Proc. of the 44th IEEE Symp. on Foundations of Computer Science, 462-471, 2003.
4. F. Barahona and W. R. Pulleyblank. Exact arborescences, matchings and cycles. Discrete Applied Mathematics, 16, 617-630, 1998.
5. R. Beier and B. Vöcking. Random knapsack in expected polynomial time. Proc. of the 35th ACM Symp. on Theory of Computing, 232-241, 2003.
6. R. Beier and B. Vöcking. Probabilistic analysis of knapsack core algorithms. Proc. of the 14th Annual ACM-SIAM Symp. on Discrete Algorithms, 2004.
7. J. Dunagan, D. A. Spielman, and S.-H. Teng. Smoothed analysis of Renegar's condition number for linear programming. Available at http://arxiv.org/abs/cs.DS/0302011, 2002.
8. V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler and C. Sohler. Smoothed motion complexity. Proc. of the 11th European Symp. on Algorithms, 2003.
9. M. E. Dyer and A. M. Frieze. Probabilistic analysis of the multidimensional knapsack problem. Mathematics of Operations Research 14(1), 162-176, 1989.
10. M. R. Garey and D. S Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
11. M. X. Goemans and R. Ravi. The Constrained Minimum Spanning Tree Problem. Fifth Scandinavian Workshop on Algorithm Theory, 66-75, 1996.
12. A. Goldberg and A. Marchetti-Spaccamela. On finding the exact solution to a Zero-One Knapsack Problem. Proc. of the 16th ACM Symp. on Theory of Computing, 359-368, 1984.
13. L. A. Levin. Average Case Complete Problems. SIAM J. Cornput., 15(1):285-286, 1986.
14. G. S. Lueker. On the average difference between the solutions to linear and integer Knapsack Problems. Applied Probability - Computer Science, the Interface, 1, Birkhauser, 1982.
15. G. S. Lueker. Average-case analysis of Off-Line and On-Line Knapsack Problems. J. of Algorithms, 19, 277-305, 1998.
16. G. S. Lueker. Exponentially small bounds on the expected optimum of the Partition and Subset Sum Problems. Random Structures and Algorithms, 12, 51-62, 1998.
17. K. Mehlhorn and M. Ziegelmann. Resource Constrained Shortest Paths. Proc. 8th European Symp. on Algorithms, 326-337, 2000.
18. K. Mulmuley, U. Vazirani and V.V. Vazirani. Matching is as easy as matrix inversion. Combinatorica 7(1):105-113, 1987.
19. C. H. Papadimitriou and M. Yannakakis. The complexity of tradeoffs, and optimal access of web sources. Proc. of the 41st IEEE Symp. on Foundations of Computer Science, 86-92, 2000.
20. J. Renegar. Some perturbation theory for linear programming. Math. Programming, 65(1, Series A), 73-91, 1994.
21. J. Renegar. Incorporating condition measures into the complexity of linear programming. SIAM J. Optim., 5(3):506-524, 1995.
22. J. Renegar. Linear programming, complexity theory and elementary functional analysis. Math. Programming, 70(3, Series A), 279-351, 1995.
23. H. M. Salkin. Integer Programming. Addison-Wesley, Reading, Mass., 1975.
24. D. A. Spielman and S.-H. Teng. Smoothed Analysis of algorithms: why the Simplex Algorithm usually takes polynomial time. Proc. of the 33rd ACM Symp. on Theory of Computing, 296-305, 2001.
25. D. A. Spielman and S.-H. Teng. Smoothed Analysis: Motivation and discrete models. Proc. of WADS 2003, 256-270, 2003.