J. Csirik, D. S. Johnson  Home/Search
Context Related
| att.com/~dsj/papers/BNF.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: att.com/~dsj/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a sequence of new linear-time, bounded-space, on-line bin packing algorithms, the K-Bounded Best Fit algorithms (BBF K ). They are based on the Q(nlogn) Best Fit algorithm in much the same way as the Next-K Fit algorithms are based on the Q(nlogn) First Fit algorithm. Unlike the Next-K Fit algorithms, whose asymptotic worst-case ratios approach the limiting value of 17/10 from above as K ® but never reach it, these new algorithms have worstcase ratio 17/10 for all K ³ 2. They also... (Update)
Context of citations to this paper: More
...BBF K . Let ABF K denote the (P BF,C FF) combination, and AFB K denote the (P FF,C BF) combination. In the preliminary version of this paper [9] we showed that both AFB K and ABF K had asymptotic worst case ratios of at least 1.7 3 (10K) for all K 2. Subsequently, tight bounds...
...and proved that R 1 AFB k = 17 10 3 10(k Gamma1) ffl Algorithm ABB k . This algorithm was investigated by Csirik and Johnson [22]. In comparison to the other three algorithms, ABB k uses the better packing and closing rules and it has the better asymptotic ratio, R 1 ABB...
Cited by: More
Improving Restoration Success in Mesh Optical Networks - Yu, Sinha, Wang, Li.. (Correct)
Approximate Solutions to Bin Packing Problems - Coffman, Jr., Csirik, Woeginger (1999) (Correct)
Bounded Space On-Line Bin Packing: Best is Better than First - Csirik, Johnson (1991) (Correct)
Active bibliography (related documents): More All
0.6: Best-Fit Bin-Packing with Random Order - Kenyon (1997) (Correct)
0.5: Better Approximation Algorithms for Bin Covering - Csirik, Johnson, Kenyon (2001) (Correct)
0.5: Computing Minimum-Weight Perfect Matchings - Cook, Rohe (1998) (Correct)
Similar documents based on text: More All
0.1: Lattices of Modal Logics and their Groups of Automorphisms - Kracht (Correct)
0.1: Stabilization-Preserving Atomicity Refinement - Nesterenko, Arora (1999) (Correct)
0.1: On Nominal Delay Minimization in LUT-Based FPGA Technology Mapping - Cong, Ding (1994) (Correct)
Related documents from co-citation: More All
3: Fast algorithms for bin packing (context) - Johnson - 1974
2: Improved space for bounded-space, on-line bin-packing (context) - WOEGINGER - 1993
2: Tight Worst-case Performance Bound for AFB k (context) - ZHANG - 1994
BibTeX entry: (Update)
J. CSIRIK AND D. S. JOHNSON, "Bounded space on-line bin packing: Best is better than first," in "Proceedings 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms," Society for Industrial Mathematics, Philadelphia, PA, 1991, 309-319. - 24 - http://citeseer.ist.psu.edu/csirik91bounded.html More
@inproceedings{ csirik91bounded,
author = "Csirik and Johnson",
title = "Bounded Space On-Line Bin Packing: Best is Better than First",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1991",
url = "citeseer.ist.psu.edu/csirik91bounded.html" }
Citations (may not include all citations):119 The Art of Computer Programming: Seminumerical Algorithms (context) - KNUTH - 1981
80 Worst-case performance bounds for simple one-dimensional pac.. (context) - JOHNSON, DEMERS et al. - 1974
46 Near-Optimal Bin Packing Algorithms (context) - JOHNSON - 1973
41 Fast algorithms for bin packing (context) - JOHNSON - 1974
36 Resource constrained scheduling as generalized bin packing (context) - GAREY, GRAHAM et al. - 1976
26 The average case analysis of some on-line algorithms for bin.. (context) - SHOR - 1986
20 Improved bounds for harmonic-based bin packing algorithms (context) - RICHEY - 1991
10 An experimental study of bin packing (context) - BENTLEY, JOHNSON et al. - 1983
10 Some unexpected expected behavior results for bin packing (context) - BENTLEY, JOHNSON et al. - 1984
7 Packing in two dimensions: Asymptotic average-case analysis .. (context) - COFFMAN, SHOR - 1993
6 A stochastic model of bin packing (context) - COFFMAN, HOFRI et al. - 1980
5 An average-case analysis of bin packing with uniformly distr.. (context) - LUEKER - 1982
4 An improved lower bound for on-line bin packing algorithms (context) - VAN VLIET - 1992
3 Bounded space on-line bin packing: Best is better than first - CSIRIK, JOHNSON - 1991
3 A simple on-line packing algorithm (context) - LEE, LEE - 1985
2 Tight Worst-case Performance Bound for AFB k (context) - ZHANG - 1994
2 Improved space for bounded-space, on-line bin-packing (context) - WOEGINGER - 1993
2 Software Exploratorium: Some random thoughts (context) - BENTLEY - 1992
2 private communication (context) - SHOR - 1990
2 Tight worst-case performance bounds for next-k-fit bin packi.. (context) - MAO - 1993
2 A probabilistic analysis of the next fit decreasing bin pack.. (context) - CSIRIK, FRENK et al. - 1986
2 the worst-case performance of the NkF bin-packing heuristic (context) - CSIRIK, IMREH - 1989
1 Tight bounds on first fit (context) - COFFMAN, JOHNSON et al. - 1997
1 Average-case analysis of the smart next fit algorithm (context) - RAMANAN - 1989
1 Best-k-Fit Bin Packing (context) - MAO - 1993
1 A new algorithm for on-line bin packing (context) - LEE, LEE - 1983
1 Probabilistic analysis of some bin-packing alogorithms (context) - KARMARKAR - 1982
1 Average-case analysis of the modified harmonic algorithm (context) - RAMANAN, TSUGA - 1989
1 Probabilistic analysis for simple one- and two-dimensional b.. (context) - FREDERICKSON - 1980
1 A bin packing algorithm with complexity O(nlogn) and perform.. (context) - KNO - 1981
1 the asymptotic worst case behavior of harmonic fit (context) - VAN VLIET - 1996
Documents on the same site (http://www.research.att.com/~dsj/papers.html): More
Bin Packing with Discrete Item Sizes, Part I.. - Coffman, Jr.. (Correct)
Bin Packing with Discrete Item Sizes, Part II.. - Coffman, Jr.. (1996) (Correct)
The Maximum Traveling Salesman Problem under.. - Barvinok, Johnson.. (1998) (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