Online bin packing with resource augmentation

Lecture Notes in Computer Science

Volumn 3351, Issue , 2005, Pages 23-35

  Epstein, Leah ^a   Van Stee, Rob ^b  

^a INTERDISCIPLINARY CENTER   (Israel)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; KNOWLEDGE ACQUISITION; ONLINE SYSTEMS;

BOUNDED SPACE ALGORITHMS; ONLINE ALGORITHMS; ONLINE BIN PACKING; RESOURCE AUGMENTATION;

VIRTUAL REALITY;

EID: 23944481439     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31833-0_4     Document Type: Conference Paper

References (13)

1. Edward G. Coffman, Michael R. Garey, and David S. Johnson. Approximation algorithms for bin packing: A survey. In D. Hochbaum, editor, Approximation algorithms. PWS Publishing Company, 1997.
2. János Csirik and Gerhard J. Woeginger. On-line packing and covering problems. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science, pages 147-177. Springer-Verlag, 1998.
3. János Csirik and Gerhard J. Woeginger. Resource augmentation for online bounded space bin packing. Journal of Algorithms, 44(2):308-320, 2002.
4. Leah Epstein, Steve S. Seiden, and Rob van Stee. New bounds for variable-sized and resource augmented online bin packing. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of Lecture Notes in Computer Science, pages 306-317. Springer, 2002.
5. Michael R. Garey, Ronald L. Graham, and Jeffrey D. Ullman. Worst-case analysis of memory allocation algorithms. In Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pages 143-150. ACM, 1972.
6. David S. Johnson. Fast algorithms for bin packing. Journal Computer Systems Science, 8:272-314, 1974.
7. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47:214-221, 2000.
8. C. C. Lee and D. T. Lee. A simple online bin packing algorithm. Journal of the ACM, 32:562-572, 1985.
9. Cynthia Phillips, Cliff Stein, Eric Torng, and Joel Wein. Optimal time-critical scheduling via resource augmentation. Algorithmica, pages 163-200, 2002.
10. P. Ramanan, D. J. Brown, C. C. Lee, and D. T. Lee. Online bin packing in linear time. Journal of Algorithms, 10:305-326, 1989.
11. Steve S. Seiden. On the online bin packing problem. Journal of the ACM, 49(5):640-671, 2002.
12. Jeffrey D. Ullman. The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ, 1971.
13. Andre van Vliet. An improved lower bound for online bin packing algorithms. Information Processing Letters, 43:277-284, 1992.