The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
The statistical adversary allows optimal money-making trading strategies
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
New bounds for multi-dimensional packing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the online bin packing problem
Journal of the ACM (JACM)
On the On-line Number of Snacks Problem
Journal of Global Optimization
On the Online Bin Packing Problem
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On-Line Algorithms for Cardinality Constrained Bin Packing Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Tight Bounds for Online Class-Constrained Packing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for online class-constrained packing
Theoretical Computer Science - Latin American theorotical informatics
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics
A two-dimensional vector packing model for the efficient use of coil cassettes
Computers and Operations Research
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
INFORMS Journal on Computing
The class constrained bin packing problem with applications to video-on-demand
Theoretical Computer Science
IBM Journal of Research and Development
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
1-Bounded Space Algorithms for 2-Dimensional Bin Packing
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Applet verification strategies for RAM-constrained devices
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
On the on-line k-taxi problem with limited look ahead
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
O((log n)2) time online approximation schemes for bin packing and subset sum problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
A new upper bound 2.5545 on 2D Online Bin Packing
ACM Transactions on Algorithms (TALG)
Online algorithm for 1-space bounded multi-dimensional bin packing
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Automating the packing heuristic design process with genetic programming
Evolutionary Computation
Bin packing with rejection revisited
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Improved online hypercube packing
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
SIGACT news online algorithms column 20: the power of harmony
ACM SIGACT News
More on online bin packing with two item sizes
Discrete Optimization
Discrete Optimization
A tight lower bound for optimal bin packing
Operations Research Letters
A linear time bin-packing algorithm
Operations Research Letters
Improved results for a memory allocation problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
Journal of Combinatorial Optimization
On-line bin packing with restricted repacking
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
In the bin-packing problem a list L of n numbers are to be packed into unit-capacity bins. For any algorithm S, let r(S) be the maximum ratio S(L)/L* for large L*, where S(L) denotes the number of bins used by S and L* denotes the minimum number needed. An on-line &Ogr;(n log n)-time algorithm RFF with r(RFF) = 5/3 and an off-line polynomial-time algorithm RFFD with r(RFFD) ≤ 11/9 - &egr; for some fixed &egr; 0, are given. These are strictly better, respectively, than two prominent algorithms: the First-Fit (FF), which is on-line with r(FF) = 17/10, and the First-Fit-Decreasing (FFD) with r(FFD) = 11/9. Furthermore, it is shown that any on-line algorithm S must have r(S) ≥ 3/2. The question, “How well can an &ogr;(n log n)-time algorithm perform?” is also discussed. It is shown that in the generalized d-dimensional bin packing, any &ogr;(n log n)-time algorithm S must have r(S) ≥ d.