Improved Lower Bounds for the Online Bin~Stretching Problem - Recherche opérationnelle des Systèmes de Production
Pré-Publication, Document De Travail Année : 2013

Improved Lower Bounds for the Online Bin~Stretching Problem

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)

Dates et 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)

Identifiants

  • HAL Id : hal-00921663 , version 4

Citer

Michaël Gabay, Nadia Brauner, Vladimir Kotov. Improved Lower Bounds for the Online Bin~Stretching Problem. 2013. ⟨hal-00921663v4⟩
330 Consultations
356 Téléchargements

Partager

More