Average-Case Analysis of the Modified Marmonic Algorithm
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.
[3] Frank Thomson Leighton,et al. Some unexpected expected behavior results for bin packing , 1984, STOC '84.
[4] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..
[5] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .
[6] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Greg N. Frederickson,et al. Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..
[9] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[10] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[11] N. Karmarkar. Probabilistic analysis of some bin-packing problems , 1982, FOCS 1982.
[12] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.