Claire Kenyon  Home/Search
Context Related
Links: ACM DBLP | lri.fr/~kenyon/Publis/binpacking.ps lix.polytechnique.fr/~...binpacking.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lri.fr/~kenyon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Best-fit is the best known algorithm for on-line binpacking, in the sense that no algorithm is known to behave better both in the worst case (when Best-fit has performance ratio 1.7) and in the average uniform case, with items drawn uniformly in the interval [0; 1] (then Best-fit has expected wasted space O(n 1=2 (log n) 3=4 )). In practical applications, Best-fit appears to perform within a few percent of optimal. In this paper, in the spirit of previous work in computational geometry, we... (Update)
Context of citations to this paper: More
.... 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...
.... Although bin packing is an NP complete problem, there are several algorithms that produce good solutions in practice [dlVL81, JDU 74, Ken96] We extend the bin packing algorithms to balance the load after generating a successful solution. The final load balancing can be...
Cited by: More
A Multi-layered Resource Management Framework for.. - Schmidt.. (2006) (Correct)
The Relative Worst Order Ratio Applied to Paging - Boyar, Favrholdt, Larsen (Correct)
Improving Restoration Success in Mesh Optical Networks - Yu, Sinha, Wang, Li.. (Correct)
Active bibliography (related documents): More All
0.6: Bounded Space On-Line Bin Packing: Best is Better than First - Csirik, Johnson (1991) (Correct)
0.3: Bin Packing with Item Fragmentation - Menakerman, Rom (2001) (Correct)
0.3: On the Fractal Beauty of Bin Packing - Epstein, Seiden, van Stee (2001) (Correct)
Similar documents based on text: More All
0.5: Linear Waste of Best Fit Bin Packing on Skewed Distributions - Kenyon, Mitzenmacher (2000) (Correct)
0.3: Open Components - Gal, Schröder-Preikschat, Spinczyk (2001) (Correct)
0.2: A Tighter Lower Bound for Optimal Bin Packing - Chao, Harper, Quong (1994) (Correct)
Related documents from co-citation: More All
4: Simple table-based modeling of storage devices (context) - Anderson
4: Ergastulum: An approach to solving the workload and device configuration problem (context) - Anderson, Kallahalla et al.
4: analytical throughput model for modern disk arrays (context) - Uysal, Alvarez et al. - 2001
BibTeX entry: (Update)
C. Kenyon. Best-fit bin-packing with random order. In Symposium on Discrete Algorithms, pages 359-- 364, January 1996. http://citeseer.ist.psu.edu/kenyon97bestfit.html More
@inproceedings{ kenyon96bestfit,
author = "Kenyon",
title = "Best-Fit Bin-Packing with Random Order",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1996",
url = "citeseer.ist.psu.edu/kenyon97bestfit.html" }
Citations (may not include all citations):356 Computers and Intractability: a guide to the theory of NPcom.. (context) - Garey, Johnson - 1979
80 Worst-case performance bounds for simple one-dimensional pac.. (context) - Johnson, Demers et al. - 1974 DBLP
53 An Efficient Approximation Scheme for the One-Dimensional Bi.. (context) - Karmakar, Karp - 1982 DBLP
41 Fast algorithms for bin-packing (context) - Johnson - 1974
30 New algorithms in bin packing (context) - Yao - 1980 ACM
27 Bin Packing can be solved within 1+ ffl in linear time (context) - de la, Lueker - 1981
26 The average-case analysis of some on-line algorithms for bin.. (context) - Shor - 1986 ACM DBLP
22 i and A. Sinclair. Biased Random Walks, Lyapunov Functions, .. (context) - Kenyon, Raban
17 Algorithms for diametral pairs and convex hulls that are opt.. (context) - Clarkson, Shor - 1988
15 and average-case analysis of best-fit bin packing (context) - Coffman, Johnson et al. - 1993
11 Probabilistic Analysis of Packing and Partitioning Algorithm.. (context) - Coffman, George et al. - 1991
10 A lower bound for on-line bin-packing (context) - Liang - 1980
8 On Line Bin Packing with Items of Random Size (context) - Rhee, Talagrand - 1993 ACM
4 Does randomization help in on-line binpacking (context) - Chandra - 1992
4 An improved lower bound for on-line bin packing algorithms (context) - Van Vliet - 1992 ACM DBLP
3 A simple on-line packing algorithm (context) - Lee, Lee - 1985
1 Online bin-packing in linear time (context) - Ramanan, Brown et al. - 1989
1 A simple proof of Liang's lower bound for on-line packing an.. (context) - Frenk - 1993
1 Improved bounds for refined harmonic bin packing (context) - Richey - 1990
Documents on the same site (http://www.lri.fr/~kenyon/): More
Selection in the Presence of Noise: The Design of.. - Adler, Gemmell.. (1995) (Correct)
Tiling a Polygon with Rectangles - Kenyon, Kenyon (1992) (Correct)
A Self-Organizing Bin Packing Heuristic - Csirik, Johnson, Kenyon, Shor.. (1999) (Correct)
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