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

Martingale Inequalities, Interpolation and NP-Complete Problems

In a previous work Rhee, W., Talagrand, M. 1987. Martingale inequalities and NP-complete problems. Math. Oper. Res.121 177--181., we showed how to use martingale inequalities in the probabilistic analysis of stochastic models of NP-complete problems to obtain sharp bounds on P|Un-EUn| ≥ t, where Un is the objective function value of the problem with n random data. Here, we show how to interpolate between martingale inequalities to obtain even sharper bounds.

Wansoo T. Rhee | Michel Talagrand | M. Talagrand

[1] Wansoo T. Rhee,et al. Martingale Inequalities and NP-Complete Problems , 1987, Math. Oper. Res..

[2] Richard M. Karp,et al. A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

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

[4] V. Milman,et al. Asymptotic Theory Of Finite Dimensional Normed Spaces , 1986 .

[5] George S. Lueker,et al. Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[7] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[8] Alan M. Frieze,et al. On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[9] J. Steele. Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .

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

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