An asymptotic fully polynomial time approximation scheme for bin covering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 175-186

  Jansen, Klaus ^a   Solis Oba, Roberto ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIN COVERINGS; BIN PACKING PROBLEM; DUAL PROBLEM; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES;

ALGORITHMS; APPROXIMATION THEORY; BINS;

BINS; POLYNOMIAL APPROXIMATION;

EID: 84878661623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_16     Document Type: Conference Paper

References (14)

1. S.B. Assman, D.S. Johnson, D.J. Kleitman and J.Y.-T. Leung, On the dual of the one-dimensional bin packing problem, Journal on Algorithms 5 (1984), 502-525.
2. S.B. Assman, Problems in Discrete Applied Mathematics, PhD thesis, Department of Mathematics, MIT, Cambridge, MA, 1983.
3. J. Csirik, J.B.G. Frenk, M. Labbe and S. Zhang, Two simple algorithms for bin covering, Acta Cybernetica 14(1999), 13-25.
4. J. Csirik, D.S. Johnson and C. Kenyon, Better approximation algorithms for bin covering, Proceedings of SIAM Conference on Discrete Algorithms (2001).
5. J. Csirik and V. Totik, On-line algorithms for a dual version of bin packing, Discrete Applied Mathematics, 21 (1988), 163-167.
6. W.F. de la Vega and C.S. Lueker, Bin packing can be solved within 1 + e in linear time, Combinatorica, 1 (1981), 349-355.
7. M.D. Grigoriadis and L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM Journal on Optimization, 4(1994), 86-107.
8. M.D. Grigoriadis and L.G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research, 21 (1996), pp. 321-340. (Pubitemid 126600323)
9. O.H. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problem, Journal of the ACM, 22 (1975), 463-468.
10. K. Jansen and H. Zhang, Approximate algorithms for general packing problems with modified logarithmic potential function, to appear: Proceedings 2nd International Conference on Theoretical Computer Science, Montreal, 2002.
11. N. Karmarkar and R.M. Karp, An efficient approximation scheme for the one-dimensional bin packing problem, Proceedings 23rd Annual Symposium on Foundations of Computer Science (1982), 312-320. (Pubitemid 13468520)
12. H. Kellerer and U. Pferschy, A new fully polynomial approximation scheme for the knapsack problem, Proceedings 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (1998), 123-134. (Pubitemid 128104535)
13. E. Lawler, Fast approximation algorithms for knapsack problems, Mathematics of Operations Research, 4(1979), 339-356.
14. S.A. Plotkin, D.B. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 20 (1995), 257-301.