D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst case bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299--325, 1974. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Ergastulum: Quickly Finding Near-Optimal Storage.. - Anderson.. (4 citations) (Correct)
....introduce constraints that existing algorithms don t handle. For instance, device utilization constraints are non additive; i.e. the net utilization of a device by multiple parts of a workload is not the simple sum of the independent utilizations of each part. Existing bin packing algorithms [18, 25] require that the constraints are additive but, as we show, some of the best fit packing algorithms [19] can be adapted to handle non additive constraints. The approach used in Ergastulum is a generalization of the best fit bin packing algorithm. First, we add randomization because it often helps ....
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst case bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299--325, 1974.
Average-Case Analyses of First Fit and Random Fit Bin Packing - Albers, Mitzenmacher (1998) (5 citations) (Correct)
....is placed in an empty bin. The performance of First Fit and Best Fit in the worst case and uniform average case has been settled for quite some time. In the worst case, the number of bins used by any of these algorithms is at most 17 10 times the optimum number of bins, as shown by Johnson et al. [9]. When item sizes are generated by U(0; 1) the continuous uniform distribution on (0; 1] then the performance measure of interest is the expected waste, which is the difference between the number of bins used and the total size of the items packed so far. Shor [15] showed that the expected ....
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham. Worst case bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299--325, 1974.
Average-Case Analysis of First Fit and Random Fit Bin Packing - Albers, Mitzenmacher (1997) (2 citations) (Correct)
....placed in an empty bin. The performance of First Fit and Best Fit in the worst case and uniform average case has been settled for quite some time. In the worst case, the number of bins used by any of these algorithms is at most 17 10 times the optimum number of bins, as shown by Johnson et al. [10]. When item sizes are generated by U(0, 1) the continuous uniform distribution on (0, 1] then the performance measure of interest is the expected waste, which is the difference between the number of bins used and the total size of the items packed so far. Shor [16] showed that the expected waste ....
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham. Worst case bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299--325, 1974.
Vertex disjoint Polyp Packing - Katona (1996) (1 citation) (Correct)
....disjoint Polyp Packing Gyula Y. Katona Mathematical Institute of the Hungarian Academy of Sciences 1. Introduction Both of the following problems may be considered as a generalization of the Bin Packing problem [2]: Given a simple path P , a set of simple paths possibly with many different lengths and a positive integer K. Is it possible to embed all the paths edge vertex disjointly into K copies of P G. O. H. Katona generalized this question: Given a graph G, a set of simple paths possibly with many ....
....algorithm and determine how many more polyps are needed to pack the paths with the First Fit algorithm than with the optimal packing in the vertex disjoint case. The corresponding results for the edge disjoint problems were presented in [3] The proofs are similar to the proofs in Johnson at al [2] which proves similar theorems about the original Bin Packing problem but it seems to be more difficult to apply the same techniques than in the edge disjoint case. 2. Worst case of First Fit Let us define the algorithm which will be investigated. Let the p polyps be indexed as P 1 ; P 2 ; ....
[Article contains additional citation context not shown here]
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey and R. L. Graham, Worst case bounds for simple one-dimensional packing algorithms, SIAM J. Comptg. 3 (1974), 299-325.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC