The maximum resource bin packing problem

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 397-408

  Boyar, Joan ^a   Epstein, Leah ^b   Favrholdt, Lene M ^a   Kohrt, Jens S ^a   Larsen, Kim S ^a   Pedersen, Morten Monrad ^a   Wøhlk, Sanne ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

BIN PACKING; BIN PACKING PROBLEM; DUAL BIN RATIOS;

COMPUTER SCIENCE;

EID: 26844482686     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_35     Document Type: Conference Paper

References (18)

1. E.M. Arkin, M.A. Bender, J.S.B. Mitchell, and S. Skiena. The Lazy Bureaucrat scheduling problem. Information and Computation, 184(1):129-146, 2003.
2. S.F. Assman, D.S. Johnson, D.J. Kleitman, and J.Y-T. Leung. On a dual version of the one-dimensional bin packing problem. J. Alg., 5(4):502-525, 1984.
3. A. Bar-Noy, R. E. Ladner, and T. Tamir. Windows scheduling as a restricted version of bin packing. In Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 224-233, 2004.
4. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
5. J. Boyar and L.M. Favrholdt. The relative worst order ratio for on-line algorithms. In Algorithms and Complexity: 5th Italian Conference, LNCS 2653, pages 58-69, 2003.
6. J. Boyar and L.M. Favrholdt. The relative worst order ratio for on-line bin packing algorithms. Technical report PP-2003-13, Department of Mathematics and Computer Science, University of Southern Denmark, 2003.
7. J. Csirik, J.B.G. Frenk, M. Labbé, and S. Zhang. Two simple algorithms for bin covering. Acta Cybemetica, 14(1): 13-25, 1999.
8. J. Csirik, D.S. Johnson, and C. Kenyon. Better approximation algorithms for bin covering. In Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 557-566, 2001.
9. L. Epstein and M. Levy. Online interval coloring and variants. In Proc. 32nd International Colloquium on Automata, Languages and Programming, 2005. To appear.
10. M.R. Garey and D.S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
11. R.L. Graham. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
12. R. Hassin and S. Rubinstein. An approximation algorithm for the maximum traveling salesman problem. Information Processing Letters, 67(3): 125-130, 1998.
13. D.S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.
14. K. Jansen and R. Solis-Oba. An asymptotic fully polynomial time approximation scheme for bin covering. Theoretical Computer Science, 306(1-3):543-551, 2003.
15. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comp., 3:299-325, 1974.
16. D.R. Karger, R. Motwani, and G.D.S. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18(1):82-98, 1997.
17. A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.
18. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.