Probabilistic analysis of k-dimensional packing algorithms☆
References (13)
- et al.
Expected performance of the shelf heuristic for 2-dimensional packing
Oper. Res. Lett.
(1989) - et al.
Martingale inequalities and the jackknife estimate of variance
Statist. Probab. Lett.
(1986) Weighted sums of certain dependent variables
Tohoku Math. J.
(1967)- et al.
Shelf algorithm for two-dimensional packing problems
SIAM J. Comput.
(1983) - et al.
Performance bounds for level-oriented two-dimensional packing algorithms
SIAM J. Comput.
(1980) - et al.
Probabilistic Analysis of Packing and Partitioning Algorithms
(1991)
There are more references available in the full text version of this article.
Cited by (2)
Approximation of some NP-hard optimization problems by finite machines, in probability
2001, Theoretical Computer ScienceProbabilistic approximation of some NP optimization problems by finite-state machines
1997, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
Research supported in part by the ONR grant N00014-91-J-1383 and in part by the CCIS at UNL.
Copyright © 1995 Published by Elsevier B.V.