Improved Lower Bounds for the Online Bin~Stretching Problem - Optimisation des systèmes de Production
Preprints, Working Papers, ... Year : 2013

Improved Lower Bounds for the Online Bin~Stretching Problem

Abstract

We 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.
Fichier principal
Vignette du fichier
article.pdf (414.73 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00921663 , version 1 (20-12-2013)
hal-00921663 , version 2 (04-03-2014)
hal-00921663 , version 3 (06-06-2015)
hal-00921663 , version 4 (11-07-2023)

Identifiers

  • HAL Id : hal-00921663 , version 4

Cite

Michaël Gabay, Nadia Brauner, Vladimir Kotov. Improved Lower Bounds for the Online Bin~Stretching Problem. 2013. ⟨hal-00921663v4⟩
333 View
357 Download

Share

More