Maximizing the Number of Unused Bins
We analyze the approximation behaviour of some of the best-known polynomial time approximation algorithms for bin-packing under an approximation criterion, called differential ratio. This measure has originally been introduced by Ausiello, D'Atri and Protasi and more recently revisited, in a more systematic way, by the first and the third authors of the present paper.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1999|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://cermsem.univ-paris1.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:pariem:1999.75. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.