Randomized algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Tight Bounds for Online Class-Constrained Packing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Online Scheduling for Sorting Buffers
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Almost optimal solutions for bin coloring problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size B ∈ N. The packing process is subject to the constraint that at any moment in time at most q ∈ N bins are partially filled. Moreover, bins may only be closed if they are filled completely. An online algorithm must pack each item without knowledge of any future items. We investigate the existence of competitive online algorithms for the bin coloring problem. We prove an upper bound of 3q-1 and a lower bound of 2q for the competitive ratio of a natural greedy-type algorithm, and show that surprisingly a trivial algorithm which uses only one open bin has a strictly better competitive ratio of 2q -1. Moreover, we show that any deterministic algorithm has a competitive ratio Ω(q) and that randomization does not improve this lower bound even when the adversary is oblivious.