Johnson, D., Demers, A., Ullman, J., Garey, M., Graham, R.: Worst-case performance bounds for simple one-dimensional packaging algorithms. SIAM Journal on Computing 3 (December 1974) 299--325 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Biased Random Walks, Lyapunov Functions, and Stochastic.. - Kenyon, Rabani, Sinclair (Correct)
....of Computer Science, University of Toronto. Computer Science Division, University of California, Berkeley CA 94720 1776. Email: sinclair cs.berkeley.edu. Supported by NSF grant CCR 9505448 and a UC Berkeley Faculty Research Grant. Best Fit was first analyzed in the worst case by Johnson et al. [9], who proved that the number of bins used is always within a factor 1.7 of that used by an optimal algorithm. When items are drawn from the uniform distribution on (0; 1] the expected waste of Best Fit was shown by Shor [12] to be Theta(n log 3=4 n) The waste is the difference between the ....
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham. Worst case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974), pp. 299--325.
Processor Allocation on Cplant: Achieving General.. - Leung, Phillips.. (2002) (Correct)
....Each bin has a fixed capacity and cannot be assigned items whose total size exceeds this capacity. The goal is to minimize the number of bins used. The o# line version is NP hard [22] and bin packing was one of the first problems to be studied in terms of both online and o#ine approximability [27, 28, 29]. Multi dimensional bin packing, where the items and bins are hyperrectangles, has also been studied. The seminal o#ine and online results appear in [12, 14] while the latest results are in [47] For a more detailed review of bin packing, see the surveys [13, 18] Bin packing results cannot be ....
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worstcase performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput., 3:256--278, 1974.
Scheduling With Tool Changes to Minimize Total Completion - Time Study Of (Correct)
....entails the minimization of the total weighted cardinality over all the blocks; this can be viewed as an extension of the bin packing problem. The worst case performance ratio of the SPT rule for the bin packing problem is 1.7, compared to 1. 22 of the First Fit Decreasing (FFD) rule [4] and [8]. We conjecture that as T C increases, the SPT schedule becomes progressively worse in the case of our problem. However, its performance may not be as bad as in the case for the bin packing problem as we see later. 3. AVAILABLE RESULTS AND SOLUTION METHOD We summarize below certain theoretical ....
....nonincreasing order of their processing times to the first among the active tools where they fit, starting with a single tool and adding tools when the currently active tools fail to accommodate a job. FFD has been shown to have a worst case performance ratio of 1. 22 for the bin packing problem [8]. The objective of minimizing the number of tool switches, one that is studied in much of the tool management literature, corresponds to the objective of this procedure. After assigning all jobs to tools using the FFD rule, the jobs and the blocks are rearranged according to the structural ....
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J Comput 3 (1974), 299 --325.
Bin Packing with Item Fragmentation - Menakerman, Rom (2001) (Correct)
....known bin packing algorithms such as Next Fit and First Fit Decreasing, as well as of other algorithms. 1. Introduction Because of its applicability to a large number of applications and because of its theoretical interest bin packing has been widely researched and investigated (see, e.g. 4] [6], 9] and [2] for a comprehensive survey) In the classical one dimensional bin packing problem, we are given a list of items L= a,a2 . an) each with a size s(aOc(O,1 ] and are asked to pack them into a minimum number of unit capacity bins. Since the problem, as many of its derivatives, is ....
D.S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SlAM J. of Computing, 3:299-325, 1974.
Processor Allocation on Cplant: Achieving General.. - Leung, Arkin.. (2002) (Correct)
....Each bin has a fixed capacity and cannot be assigned items whose total size exceeds this capacity. The goal is to minimize the number of bins used. The offline version is NP hard [22] and bin packing was one of the first problems to be studied in terms of both online and offline approximability [27, 28, 29]. Multi dimensional bin packing, where the items and bins are hyperrectangles, has also been studied. The seminal offline and online results appear in [12, 14] while the latest results are in [47] For a more detailed review of bin packing, see the surveys [13, 18] Bin packing results cannot be ....
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput., 3:256--278, 1974.
New Bounds for Variable-Sized Online Bin Packing - Seiden, van Stee, Epstein (2003) (Correct)
....with asymptotic performance ratio close to Ro T. Previous results. The online bin packing problem was first investigated by Johnson [9, 10] He showed that the NEXT FIT algorithm has performance ratio 2. Subsequently, it was shown by Johnson et al. that the FIRST FIT algorithm has per 7 [11]. Yao showed that REVISED FIRST FIT has performance ratio formance ratio T5 and further showed that no online algorithm has performance ratio less than 32 [21] Brown [1] and Liang [14] independently improved this lower bound to 1.53635. This was subsequently improved by van Vliet to 1.54014 ....
D. S. JOHNSON, A. DEMERS, J. D. ULLMAN, M. R. GAREY, AND R. L. GRAHAM, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput., 3 (1974), pp. 299-325.
Efficient Strategies for Partitioning and Querying.. - Codenotti, De.. (2003) (Correct)
.... Fit (HFF) is based on a straightforward on line algorithm that keeps one open set at a time and packs items until at least half the capacity is used (possibly joining the two sets with smallest level when all items have been taken care of) The second, which we call First Fit Decreasing (FFD) [9], is based on the well known First Fit Decreasing Bin Packing strategy. We also implemented Simple, that, as already pointed out, just packs the leaves traversing the frontier of the tree from left to right using for every set al..l the available capacity. We use Simple mainly as a benchmark to test ....
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. of Computing 3 (1974), 299-325.
Parameterized Complexity: A Framework for Systematically.. - Downey, Fellows, Stege (1997) (41 citations) (Correct)
....chapter on coping with NP completeness in the famous book by Garey and Johnson [GJ79] is devoted to explaining the basic ideas of polynomial time approximation algorithms and schemes. Early on, important polynomial time approximation schemes were found for NP complete problems such as Bin Packing [JDUGG74] and Knapsack [IK75] However, apart from a few similar results on problems mostly of this same general flavor, it now seems to be clear, on the basis of powerful new proof techniques [ALMSS92] that these results are not typical for NP hard and otherwise intractable problems. After a long period ....
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey and R. L. Graham, "Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms," SIAM J. Computing 3 (1974), 299--325.
Evolving Bin Packing Heuristics with Genetic - Programming Burke Hyde (2006) (Correct)
No context found.
Johnson, D., Demers, A., Ullman, J., Garey, M., Graham, R.: Worst-case performance bounds for simple one-dimensional packaging algorithms. SIAM Journal on Computing 3 (December 1974) 299--325
Algorithmic Support for Commodity-Based Parallel Computing.. - Leung, Phillips, al. (2003) (Correct)
No context found.
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput., 3:256--278, 1974.
Applet Verification Strategies for RAM-Constrained Devices - Maltesson, al. (2003) (Correct)
No context found.
D. Johnson, A. Demers, J. Ullman, M. Garey, R. Graham, Worst-case performance bounds for simple one-dimensional packaging algorithms, SIAM Journal on Computing, 3(4):299-325, December 1974.
Applet Verification Strategies for RAM-Constrained Devices - Maltesson, al. (2003) (Correct)
No context found.
D. Johnson, A. Demers, J. Ullman, M. Garey, R. Graham, Worst-case performance bounds for simple one-dimensional packaging algorithms, SIAM Journal on Computing, 3(4):299-325, December 1974.
New Directions in Machine Scheduling - Uthaisombut (2000) (Correct)
No context found.
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299-325, 1974.
Applying Extra-Resource Analysis to Load Balancing - Brehob, Torng, Uthaisombut (2000) (16 citations) (Correct)
No context found.
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299-325, 1974.
Applying Extra-Resource Analysis to Load Balancing - Brehob, Torng, Uthaisombut (1999) (16 citations) (Correct)
No context found.
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst case performance bounds for simple one-dimensional packing algorithms. SIAM J. on Computing, 3:299-325, 1974.
Applet Verification Strategies for RAM-Constrained Devices - Maltesson, al. (2003) (Correct)
No context found.
D. Johnson, A. Demers, J. Ullman, M. Garey, R. Graham, Worst-case performance bounds for simple one-dimensional packaging algorithms, SIAM Journal on Computing, 3(4):299-325, December 1974.
Nearly Optimal Competitive Online Replacement - Policies Ran El-Yaniv (Correct)
No context found.
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299--325, 1974.
Applet Verification Strategies for RAM-Constrained Devices - Maltesson (2003) (Correct)
No context found.
D. Johnson, A. Demers, J. Ullman, M. Garey, R. Graham, Worst-case performance bounds for simple one-dimensional packaging algorithms, SIAM Journal on Computing, 3(4):299-325, December 1974.
Applet Verification Strategies for RAM-Constrained Devices - Maltesson, al. (2003) (Correct)
No context found.
D. Johnson, A. Demers, J. Ullman, M. Garey, R. Graham, Worst-case performance bounds for simple one-dimensional packaging algorithms, SIAM Journal on Computing, 3(4):299-325, December 1974.
Packet Scheduling with Fragmentation - Naaman, Rom (Correct)
No context found.
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple onedimensional packing algorithms. SIAM J. of Computing, vol. 3, pp. 299-325, 1974.
On Online Computation - Irani, Karlin (1997) (44 citations) (Correct)
No context found.
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms", In SIAM Journal on Computing, 3: 299---325, 1974.
Vmalloc: A General and Efficient Memory Allocator - Vo (1996) (17 citations) (Correct)
No context found.
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst case performance bounds for simple one-dimensional packing algorithms. SIAM J. Computing, 3:299--325, 1974.
Parametric On-Line Algorithms for Packing Rectangles and Boxes - Miyazawa, Wakabayashi (Correct)
No context found.
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3 (1974) 299-325.
Researching System Administration - Anderson (Correct)
No context found.
David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, Michael R. Garey, and Ron L. Graham. Worstcase performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, Springer Verlag (Heidelberg, FRG and NewYork NY, USA)-Verlag, 3:299--325, 1974.
Parameterized Complexity After (Almost) 10 Years: Review and.. - Downey, Fellows (Correct)
No context found.
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey and R. L. Graham, "Worst-Case Performance Bounds for Simple OneDimensional Packing Algorithms," SIAM J. Computing 3 (1974), 299-- 325.
First 50 documents Next 50
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