A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line bin packing in linear time
Journal of Algorithms
An on-line algorithm for variable-sized bin packing
Acta Informatica
Improved bounds for harmonic-based bin packing algorithms
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
An improved lower bound for on-line bin packing algorithms
Information Processing Letters
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
New Algorithms for Bin Packing
Journal of the ACM (JACM)
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
SIAM Journal on Discrete Mathematics
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Windows scheduling as a restricted version of Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Simulative Analysis of Access Selection Algorithms for Multi-Access Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Bin packing problems with rejection penalties and their dual problems
Information and Computation
Maximizing data locality in distributed systems
Journal of Computer and System Sciences
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms (TALG)
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms (TALG)
Online bin packing with arbitrary release times
Theoretical Computer Science
The class constrained bin packing problem with applications to video-on-demand
Theoretical Computer Science
Bin packing with controllable item sizes
Information and Computation
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Dynamic bin packing of unit fractions items
Theoretical Computer Science
Offline and online aspects of defragmenting the module layout of a partially reconfigurable device
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Resource augmented semi-online bounded space bin packing
Discrete Applied Mathematics
Variable-Size Rectangle Covering
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
1-Bounded Space Algorithms for 2-Dimensional Bin Packing
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Bin packing problems with rejection penalties and their dual problems
Information and Computation
On-Line Sequential Bin Packing
The Journal of Machine Learning Research
Two-dimensional online bin packing with rotation
Theoretical Computer Science
Class constrained bin packing revisited
Theoretical Computer Science
Dynamic bin packing with unit fraction items revisited
Information Processing Letters
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
New lower bounds for certain classes of bin packing algorithms
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A new upper bound 2.5545 on 2D Online Bin Packing
ACM Transactions on Algorithms (TALG)
Policy matrix evolution for generation of heuristics
Proceedings of the 13th annual conference on Genetic and evolutionary computation
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
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online interval coloring and variants
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Dynamic bin packing of unit fractions items
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Bin packing and covering problems with rejection
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On dynamic bin packing: an improved lower bound and resource augmentation analysis
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A robust APTAS for the classical bin packing problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Online bin packing with resource augmentation
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and 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
New lower bounds for certain classes of bin packing algorithms
Theoretical Computer Science
SIGACT news online algorithms column 20: the power of harmony
ACM SIGACT News
More on online bin packing with two item sizes
Discrete Optimization
Online bin packing with resource augmentation
Discrete Optimization
On-line bin packing with arbitrary release times
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A framework for partitioning and execution of data stream applications in mobile cloud computing
ACM SIGMETRICS Performance Evaluation Review
Bin covering with cardinality constraints
Discrete Applied Mathematics
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
Journal of Combinatorial Optimization
A robust AFPTAS for online bin packing with polynomial migration,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On-line bin packing with restricted repacking
Journal of Combinatorial Optimization
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
A new framework for analyzing online bin packing algorithms is presented. This framework presents a unified way of explaining the performance of algorithms based on the Harmonic approach. Within this framework, it is shown that a new algorithm, Harmonic++, has asymptotic performance ratio at most 1.58889. It is also shown that the analysis of Harmonic+1 presented in Richey [1991] is incorrect; this is a fundamental logical flaw, not an error in calculation or an omitted case. The asymptotic performance ratio of Harmonic+1 is at least 1.59217. Thus, Harmonic++ provides the best upper bound for the online bin packing problem to date.