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
TypeArticle accepté pour publication ou publié
Journal nameApplied Mathematics Letters
MetadataShow full item record
Abstract (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.
Subjects / KeywordsBin-packing; Polynomial approximation
Showing items related by title and author.
Asymptotic differential approximation ratio: definitions, motivations and an application to bin-packing Demange, Marc; Paschos, Vangelis (1999) Article accepté pour publication ou publié
Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation Paschos, Vangelis (2013) Communication / Conférence
Paschos, Vangelis; Monnot, Jérôme; Demange, Marc (2001) Article accepté pour publication ou publié
On an approximation measure founded on the links between optimization and polynomial approximation theory Demange, Marc; Paschos, Vangelis (1996) Article accepté pour publication ou publié
Monnot, Jérôme; Demange, Marc; Paschos, Vangelis (2003) Article accepté pour publication ou publié