Fair versus unrestricted bin packing

Algorithmica (New York)

Volumn 34, Issue 2, 2002, Pages 181-196

  Azar, Yossi ^a,b   Boyar, Joan ^c,d   Epstein, Leah ^e   Favrholdt, Lene M ^c,d   Larsen, Kim S ^c,d   Nielsen, Morten N ^c,d  

^a TEL AVIV UNIVERSITY   (Israel)

^b Israel Science Foundation   (Denmark)

^c UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^d Danish Nat Science Research Council   (Denmark)

^e INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Admission control; Bin Packing; Competitive analysis; Dual Bin Packing; On line algorithms; Randomization; Restricted adversaries

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE; COMPUTER SIMULATION; ONLINE SYSTEMS; OPTIMIZATION; RANDOM PROCESSES;

PRODUCT PACKINGS;

PACKAGING;

EID: 0141957144     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0965-6     Document Type: Article

References (15)

1. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-Competitive On-Line Routing. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
2. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive Non-Preemptive Call Control. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 312-320, 1994.
3. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-Line Admission Control and Circuit Routing for High Performance Computation and Communication. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 412-423, 1994.
4. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, 1998.
5. J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403-117, 1999.
6. J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function: A Generalization of the Competitive Ratio. SIAM Journal on Computing, 31(1):233-258, 2001.
7. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin Packing: A Survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 2, pages 46-93. PWS, Boston, MA, 1997.
8. E. G. Coffman, Jr., and J. Y.-T. Leung. Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. SIAM Journal on Computing, 8:202-217, 1979.
9. E. G. Coffman, Jr., J. Y.-T. Leung, and D. W. Ting. Bin Packing: Maximizing the Number of Pieces Packed. Acta Informatica, 9:263-271, 1978.
10. J. Csirik and G. Woeginger. On-Line Packing and Covering Problems. In A. Fiat and G. J. Woeginger, editors, Online Algorithms, volume 1442 of Lecture Notes in Computer Science, chapter 7, pages 147-177. Springer-Verlag, Berlin, 1998.
11. D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS, Boston, MA, 1997.
12. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive Snoopy Caching. Algorithmica, 3:79-119, 1988.
13. S. Seiden. On the Online Bin Packing Problem. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, pages 237-248, 2001.
14. D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28(2):202-208, 1985.
15. A. van Vliet. An Improved Lower Bound for Online Bin Packing Algorithms, Information Processing Letters, 43:277-284, 1992.