Binary search trees of bounded balance
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A simulation of dynamic task allocation in a distributed computer system
WSC '87 Proceedings of the 19th conference on Winter simulation
The Match Fit Algorithm: A Testbed for the Computational Motivation of Attention
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Bin Packing with Item Fragmentation
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
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
Tight Bounds for Online Class-Constrained Packing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Code-Size Minimization in Multiprocessor Real-Time Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Two- and three-dimensional parametric packing
Computers and Operations Research
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
The class constrained bin packing problem with applications to video-on-demand
Theoretical Computer Science
Bin packing with controllable item sizes
Information and Computation
Resource augmented semi-online bounded space bin packing
Discrete Applied Mathematics
Tight results for Next Fit and Worst Fit with resource augmentation
Theoretical Computer Science
Two-dimensional online bin packing with rotation
Theoretical Computer Science
Cost-based vectorization of instance-based integration processes
Information Systems
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 PSO based multi-robot task allocation
International Journal of Computational Vision and Robotics
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
Journal of Systems Architecture: the EUROMICRO Journal
OFDMA downlink burst allocation mechanism for IEEE 802.16e networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
ChronOS Linux: a best-effort real-time multiprocessor Linux kernel
Proceedings of the 48th Design Automation Conference
The MOPED framework: Object recognition and pose estimation for manipulation
International Journal of Robotics Research
Survivable impairment-aware traffic grooming in WDM rings
Proceedings of the 23rd International Teletraffic Congress
Online bin packing of fragile objects with application in cellular networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Online bin packing with resource augmentation
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Comparing online algorithms for bin packing problems
Journal of Scheduling
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Bin packing with rejection revisited
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Improving the performance of heuristic algorithms based on causal inference
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
New lower bounds for certain classes of bin packing algorithms
Theoretical Computer Science
Non-preemptive scheduling to maximize the minimum global inter-completion time
Automatica (Journal of IFAC)
SIGACT news online algorithms column 20: the power of harmony
ACM SIGACT News
On the absolute approximation ratio for First Fit and related results
Discrete Applied Mathematics
Online variable-sized bin packing with conflicts
Discrete Optimization
Bounds for online bounded space hypercube packing
Discrete Optimization
More on online bin packing with two item sizes
Discrete Optimization
Online bin packing with resource augmentation
Discrete Optimization
An on-line algorithm for multidimensional bin packing
Operations Research Letters
A tight lower bound for optimal bin packing
Operations Research Letters
A linear time bin-packing algorithm
Operations Research Letters
Worst-case analysis of the subset sum algorithm for bin packing
Operations Research Letters
Convergence of optimal stochastic bin packing
Operations Research Letters
Improved results for a memory allocation problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Efficient resource allocation for emerging OFDMA wireless networks
Computer Communications
Algorithms for scheduling of chemotherapy plans
Computers in Biology and Medicine
Hi-index | 0.01 |
Low-order polynomial time algorithms for near-optimal solutions to the problem of bin packing are studied. The previously analyzed FIRST FIT and BEST FIT packing rules are shown to be members of a more generalized class of packing rules all of which have the same worst case behavior. If the input list is in decreasing order, the worst case behavior of the packing rules in the class is considerably improved and, if not the same for all, at least restricted to a narrow range of possibilities. Finally, after showing that any implementation of a packing rule in the class requires at least 0(n log n) comparisons, we present linear-time approximations to these packing rules whose worst case behavior is as good as that of FIRST FIT under a large variety of restrictions on the input.