A fast asymptotic approximation scheme for bin packing with rejection

Theoretical Computer Science

Volumn 393, Issue 1-3, 2008, Pages 14-22

  Bein, Wolfgang ^a   Correa, José R ^b   Han, Xin ^c  

^a UNIVERSITY OF NEVADA   (United States)

^b UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Approximation scheme; Bin packing; Knapsack problem; Rejection penalty

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION SCHEMES; BIN PACKING; KNAPSACK PROBLEMS; REJECTION PENALTY;

ASYMPTOTIC ANALYSIS;

EID: 39849110612     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.10.042     Document Type: Article

References (18)

1. Bartal W., Leonardi S., Marchetti-Spaccamela A., Sgall J., and Stougie L. Multiprocessor scheduling with rejection. SIAM J. Discrete Math. 13 1 (2000) 64-78
2. Chekuri C., and Khanna S. A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35 3 (2005) 713-728
3. Coffman E.G., Garey M.R., and Johnson D.S. Approximation algorithms for bin packing: A survey. In: Hochbaum D. (Ed). Approximation Algorithms for NP-hard Problems (1996), PWS Publishing, Boston 46-93
4. G. Dósa, Y. He, Bin packing problems with rejection penalties and their dual problems. Inform. Comput. 204 (5) 795-815. Preliminary version in proceedings of COCOON 2005, Springer LNCS 3595, 885-894, 2006
5. L. Epstein, Bin packing with rejection revisited, in: Proceedings of the 4th Workshop on Approximation and Online Algorithms, WAOA, 2006, pp. 146-159
6. Fernandez de~la Vega W., and Lueker G. Bin packing can be solved within 1 + ε in linear time. Combinatorica 1 (1981) 349-355
7. Friesen D.K., and Langston M.A. Variable sized bin packing. SIAM J. Comput. 15 1 (1986) 222-230
8. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), W.H. Freeman and Co., San Francisco
9. Hoogeveen H., Skutella M., and Woeginger G. Preemptive scheduling with rejection. Math. Program., Ser. B 94 2-3 (2003) 361-374
10. Ibarra O.H., and Kim C.E. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. J. ACM 22 4 (1975) 463-468
11. Johnson D.S., and Garey M.R. A 71/60 theorem for bin packing. J. Complexity 1 1 (1985) 65-106
12. N. Karmarkar, R.M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, in: Proc. 23rd Annual IEEE Symp. Found. Comput. Sci., 1982, pp. 312-320
13. Kellerer H. A polynomial time approximation scheme for the multiple knapsack problem. Proceedings RANDOM-APPROX. Springer LNCS vol. 1671 (1999) 51-62
14. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer, Berlin
15. Lawler E.L. Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4 4 (1979) 339-356
16. Murgolo F.D. An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput. 16 1 (1987) 149-161
17. Shachnai H., and Tamir T. Polynomial time approximation schemes - a survey. In: Gonzalez T.F. (Ed). Handbook of Approximation Algorithms and Metaheuristics (2007), Chapman & Hall, Boca Raton
18. Vazirani V. Approximation Algorithms (2001), Springer, Berlin