论文信息 - Martingale Inequalities and NP-Complete Problems

Martingale Inequalities and NP-Complete Problems

We use martingale inequalities in the probabilistic analysis of stochastic models of NP-complete problems. We give examples of applications to the Bin Packing and Traveling-Salesman Problems. In both cases, we obtain sharp bounds on Pr(|Un − EUn| > t), where Un is the objective function value of the problem with n random data.

Wansoo T. Rhee | Michel Talagrand | M. Talagrand

[1] Wansoo T. Rhee,et al. Martingale inequalities and the Jackknife estimate of variance , 1986 .

[2] B. Weide. Statistical methods in algorithm design and analysis. , 1978 .

[3] Michael J. Magazine,et al. Probabilistic Analysis of Bin Packing Heuristics , 1984, Oper. Res..

[4] Wansoo T. Rhee. Convergence of optimal stochastic bin packing , 1985 .

[5] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[6] Adriano M. Garsia,et al. Martingale inequalities: seminar notes on recent progress , 1973 .

[7] J. Michael Steele,et al. Complete Convergence of Short Paths and Karp's Algorithm for the TSP , 1981, Math. Oper. Res..

[8] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10] W. Stout. Almost sure convergence , 1974 .

[11] B. Efron,et al. The Jackknife Estimate of Variance , 1981 .