Resource augmented semi-online bounded space bin packing

Discrete Applied Mathematics

Volumn 157, Issue 13, 2009, Pages 2785-2798

  Epstein, Leah ^a   Kleiman, Elena ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Bin packing; Online problems; Repacking

Indexed keywords

BIN PACKING; BIN SIZE; BOUNDED SPACE ALGORITHMS; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; LOWER BOUNDS; OFFLINE; ON-LINE ALGORITHMS; ON-LINE CONDITIONS; ONLINE PROBLEMS; PACKING ALGORITHMS; POLYNOMIAL-TIME; REPACKING; RESOURCE AUGMENTATION; SEMI-ONLINE; WORST CASE;

ALGORITHMS; CONTROL THEORY; POLYNOMIAL APPROXIMATION;

BINS;

EID: 67349203814     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.03.015     Document Type: Article

References (27)

1. Albers S., Arora S., and Khanna S. Page replacement for general caching problems. Proc. 10th Symp. on Discrete Algorithms, SODA (1999), ACM/SIAM 31-40
2. Azar Y., Epstein L., and van Stee R. Resource augmentation in load balancing. J. Scheduling 3 5 (2000) 249-258
3. Csirik J., and Woeginger G.J. Resource augmentation for online bounded space bin packing. J. Algorithms 44 2 (2002) 308-320
4. Edmonds J. Scheduling in the dark. Proc. 31st Symp. Theory of Computing, STOC (1999), ACM 179-188
5. Epstein L., Kleiman Y., Sgall J., and van Stee R. Paging with connections: Fifo strikes again. Theoret. Comput. Sci. 377 1-3 (2007) 55-64
6. Epstein L., and van Stee R. Online bin packing with resource augmentation. Proc. of the Approximation and Online Algorithms, Second International Workshop (2004), WAOA 23-35
7. G. Galambos, A new heuristic for the classical bin packing problem. Technical Report 82, Institut für Mathematik, Universität Augsburg, Germany, 1985
8. Galambos G. Parametric lower bounds for online bin packing. SIAM J. Alg. Disc. Methods 7 (1986) 362-367
9. Galambos G., and Woeginger G.J. Repacking helps in bounded space online bin packing. Computing 49 (1993) 329-338
10. Gambosi G., Postiglione A., and Talamo M. Algorithms for the relaxed online bin-packing model. SIAM J. Comput. 30 (2000) 1532-1551
11. M.R. Garey, R.L. Graham, J.D. Ullman, Worst-case analysis of memory allocation algorithms. In: Proc of the 4th Symp. Theory of Computing, STOC'72, 1972, pp. 143-150
12. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman and Company, San Francisco
13. Golomb S.W. On certain nonlinear recurring sequences. AMM 70 4 (1963) 403-405
14. Grove E.F. Online binpacking with lookahead. Proc. 6th Symp. on Discrete Algorithms, SODA (1995), ACM/SIAM 430-436
15. Gutin G., Jensen T., and Yeo A. Batched bin packing. Discrete Optim. 2 (2005) 71-82
16. Ivkovic Z., and Lloyd E. A fundamental restriction on fully dynamic maintenance of bin packing. Inform. Process. Lett. 59 (1996) 229-232
17. Ivkovic Z., and Lloyd E.L. Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM J. Comput. 28 2 (1998) 574-611
18. Johnson D.S. Fast algorithms for bin packing. J. Comput. Syst. Sci. 8 (1974) 272-314
19. Johnson D.S., Demers A., Ullman J.D., Garey M.R., and Graham R.L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3 (1974) 256-278
20. Kalyanasundaram B., and Pruhs K. Speed is as powerful as clairvoyance. J. ACM 47 4 (2000) 617-643
21. Lee C.C., and Lee D.T. A simple online bin packing algorithm. J. ACM 32 (1985) 562-572
22. Phillips C.A., Stein C., Torng E., and Wein J. Optimal time-critical scheduling via resource augmentation. Algorithmica 32 2 (2002) 163-200
23. Ramanan P., Brown D.J., Lee C.C., and Lee D.T. Online bin packing in linear time. J. Algorithms 10 (1989) 305-326
24. Seiden S.S. On the online bin packing problem. J. ACM 49 5 (2002) 640-671
25. J.D. Ullman, The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ, 1971
26. van Vliet A. An improved lower bound for online bin packing algorithms. Inform. Process. Lett. 43 (1992) 277-284
27. Woeginger G.J. Improved space for bounded-space online bin packing. SIAM J. Discrete Math. 6 (1993) 575-581