Add to ORKGWe use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem. We also present a lower bound, with value 7/6, on the expected competitive ratio of randomized algorithms for the bin stretching problem
We are given a sequence of items that can be packed into m unit size bins. In the classical bin pack...
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
We are given a sequence of items that can be packed into m unit size bins. In the classical bin pack...
We use game theory techniques to automatically compute improved lower bounds on the competitive rati...
International audienceWe use game theory techniques to automatically compute improved lowerbounds on...
We use game theory techniques to automatically compute improved lower bounds on the competitive rati...
International audienceThere are several problems in the theory of online computation where tight low...
In competitive analysis, we usually do not put any restrictions on the computational complexity of o...
Online Bin Stretching: Algorithms and Computer Lower Bounds Author: Martin Böhm Abstract: We investi...
textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line alg...
Abstract. Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has t...
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the ...
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the ...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We are given a sequence of items that can be packed into m unit size bins. In the classical bin pack...
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
We are given a sequence of items that can be packed into m unit size bins. In the classical bin pack...
We use game theory techniques to automatically compute improved lower bounds on the competitive rati...
International audienceWe use game theory techniques to automatically compute improved lowerbounds on...
We use game theory techniques to automatically compute improved lower bounds on the competitive rati...
International audienceThere are several problems in the theory of online computation where tight low...
In competitive analysis, we usually do not put any restrictions on the computational complexity of o...
Online Bin Stretching: Algorithms and Computer Lower Bounds Author: Martin Böhm Abstract: We investi...
textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line alg...
Abstract. Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has t...
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the ...
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the ...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We are given a sequence of items that can be packed into m unit size bins. In the classical bin pack...
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
We are given a sequence of items that can be packed into m unit size bins. In the classical bin pack...