Marc Demange, Jerome Monnot, Vangelis Th. Paschos  Home/Search
Context
Related
| lamsade.dauphine.fr/~monnot/i...ffd.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lamsade.dauphine....publications2 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We analyze the approximation behavior of some of the best-known polynomial-time approximation algorithms for bin-packing under an approximation criterion, called di#erential ratio, informally the ratio (n #(I))/(n #(I)), where n is the size of the input list, #(I) is the size of the solution provided by an approximation algorithm and #(I) is the size of the optimal one. This measure has originally been introduced by Ausiello, D'Atri and Protasi and more recently revisited, in a more... (Update)
Active bibliography (related documents): More All
0.6: The Maximum F-Depth Spanning Tree Problem - Monnot (Correct)
0.6: Differential Approximation of NP-Hard Problems with Equal Size.. - Monnot (Correct)
0.3: Differential Approximation Results for the Traveling Salesman and .. - Monnot (Correct)
Similar documents based on text: More All
0.7: Difficulté Relative De L'approximation Constructive.. - Demange, Paschos (Correct)
0.5: Bottleneck Shortest Paths on a Partially Ordered Scale - Monnot, Spanjaard (Correct)
0.3: Finite Element Methods for Active Contour Models and Balloons.. - Cohen, Cohen (1991) (Correct)
BibTeX entry: (Update)
@misc{ demange-maximizing,
author = "Marc Demange and Jerome Monnot and Vangelis Th. Paschos",
title = "Maximizing the Number of Unused Bins",
url = "citeseer.ist.psu.edu/724260.html" }
Citations (may not include all citations):686 A guide to the theory of NP-completeness (context) - Garey, Johnson et al. - 1979
482 Combinatorial optimization: algorithms and complexity (context) - Papadimitriou, Steiglitz - 1981
41 Structure preserving reductions among convex optimization pr.. (context) - Ausiello, D'Atri et al. - 1980
8 an approximation measure founded on the links between optimi.. (context) - Demange, Paschos - 1996
5 erential approximation algorithms for some combinatorial opt.. (context) - Demange, Grisoni et al. - 1998
5 New worst-case results for the bin-packing problem (context) - Simchi-Levi - 1994
3 Families of critical instances and polynomial approximation (context) - Monnot - 1998
1 motivations and application to some combinatorial problems (context) - Demange, Paschos et al. - 1999
Documents on the same site (http://www.lamsade.dauphine.fr/~monnot/publications2.htm): More
The Maximum F-Depth Spanning Tree Problem - Monnot (Correct)
Differential approximation results for the Steiner tree.. - Demange, Monnot, Paschos (Correct)
Local Search for the Minimum Label Spanning Tree.. - Brüggemann, Monnot.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC