Thumbnail - Request a copy

Bridging gap between standard and differential polynomial approximation: the case of bin-packing

Demange, Marc; Monnot, Jérôme; Paschos, Vangelis (1999), Bridging gap between standard and differential polynomial approximation: the case of bin-packing, Applied Mathematics Letters, 12, 7, p. 127-133. http://dx.doi.org/10.1016/S0893-9659(99)00112-3

Type
Article accepté pour publication ou publié
Date
1999
Nom de la revue
Applied Mathematics Letters
Volume
12
Numéro
7
Éditeur
Elsevier
Pages
127-133
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Demange, Marc
Monnot, Jérôme cc
Paschos, Vangelis
Résumé (EN)
The purpose of this paper is mainly to prove the following theorem: for every polynomial time algorithm running in time T(n) and guaranteeing standard-approximation ratio varrho for bin-packing, there exists an algorithm running in time O(nT(n)) and achieving differential-approximation ratio 2 − varrho for BP. This theorem has two main impacts. The first one is “operational”, deriving a polynomial time differential-approximation schema for bin-packing. The second one is structural, establishing a kind of reduction (to our knowledge not existing until now) between standard approximation and differential one.
Mots-clés
Bin-packing; Polynomial approximation