Rob van Stee
- Yossi Azar and Leah Epstein. On two dimensional packing. J. Alg., 25(2):290--310, 1997. Google Scholar
Digital Library
- Brenda S. Baker, Donna J. Brown, and Howard P. Katseff. Lower bounds for two-dimensional packing algorithms. Acta Inform., 8:207--225, 1982.Google Scholar
- Brenda S. Baker and J. S. Schwartz. Shelf algorithms for two-dimensional packing problems. SIAM J. Comput., 12:508--525, 1983.Google ScholarDigital Library
- János Balogh, József Békési, and Gábor Galambos. New lower bounds for certain classes of bin packing algorithms. In Klaus Jansen and Roberto Solis-Oba, editors, Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, volume 6534 of LNCS, pages 25--36. Springer, 2011. Google ScholarDigital Library
- János Balogh, József Békési, Gábor Galambos, and Gerhard Reinelt. Lower bound for the online bin packing problem with restricted repacking. SIAM J. Comput., 38(1):398--410, 2008. Google ScholarDigital Library
- Amotz Bar-Noy, Richard E. Ladner, and Tami Tamir. Windows scheduling as a restricted version of bin packing. ACM Trans. Alg., 3(3), 2007. Google ScholarDigital Library
- David Blitz, Andre van Vliet, and Gerhard J. Woeginger. Lower bounds on the asymptotic worst-case ratio of online bin packing algorithms. Unpublished manuscript, 1996.Google Scholar
- Joan Boyar, Leah Epstein, and Asaf Levin. Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci., 411(26-28):2572--2580, 2010. Google ScholarDigital Library
- Donna J. Brown. A lower bound for on-line one-dimensional bin packing algorithms. Technical Report R-864, Coordinated Sci. Lab., Urbana, Illinois, 1979.Google Scholar
- Joseph Wun-Tat Chan, Tak Wah Lam, and Prudence W. H. Wong. Dynamic bin packing of unit fractions items. Theor. Comput. Sci., 409(3):521--529, 2008. Google ScholarDigital Library
- Joseph Wun-Tat Chan, Prudence W. H. Wong, and Fencol C. C. Yung. On dynamic bin packing: An improved lower bound and resource augmentation analysis. Algorithmica, 53(2):172--206, 2009. Google ScholarDigital Library
- Marek Chrobak, Jiõí Sgall, and Gerhard J. Woeginger. Two-bounded-space bin packing revisited. In Camil Demetrescu and Magnús M. Halldórsson, editors, Algorithms - ESA 2011 - 19th Annual European Symposium, volume 6942 of Lecture Notes in Computer Science, pages 263--274. Springer, 2011. Google ScholarDigital Library
- Edward G. Coffman, Michael R. Garey, and David S. Johnson. Dynamic bin packing. SIAM J. Comput., 12:227--258, 1983.Google ScholarDigital Library
- János Csirik and David S. Johnson. Bounded space on-line bin packing: Best is better than First. Algorithmica, 31(2):115--138, 2001.Google ScholarCross Ref
- János Csirik and Gerhard J. Woeginger. Resource augmentation for online bounded space bin packing. J. Algorithms 44(2):308--320, 2002. Google ScholarDigital Library
- György Dósa and Yong He. Bin packing problems with rejection penalties and their dual problems. Inf. Comput., 204(5):795--815, 2006. Google ScholarDigital Library
- Leah Epstein. Online bin packing with cardinality constraints. SIAM J. Discrete Math., 20(4):1015--1030, 2006. Google ScholarDigital Library
- Leah Epstein. Bin packing with rejection revisited. Algorithmica, 56(4):505--528, 2010. Google ScholarDigital Library
- Leah Epstein and Rob van Stee. Online square and cube packing. Acta Inform., 41(9):595--606, 2005.Google ScholarDigital Library
- Leah Epstein and Rob van Stee. Online bin packing with resource augmentation. Discr. Optim., 4(3-4):322--333, 2007. Google ScholarDigital Library
- Sándor Fekete, Tom Kamphans, and Nils Schweer. Online square packing. In Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, and Csaba Tóth, editors, Algorithms and Data Structures (WADS 2009), volume 5664 of LNCS, pages 302--314. Springer Berlin / Heidelberg, 2009. Google ScholarDigital Library
- Michael R. Garey, Ronald L. Graham, David S. Johnson, and Andrew Chi-Chi Yao. Resource Constrained Scheduling as Generalized Bin Packing. J. Combin. Theory Ser. A 21:257--298, 1976.Google ScholarCross Ref
- Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, and Yong Zhang. A new upper bound 2.5545 on 2d online bin packing. ACM Trans. Alg., 7(4):50, 2011. Google ScholarDigital Library
- Xin Han, Kazuo Iwama, Deshi Ye, and Guochuan Zhang. Strip packing vs. bin packing. In Ming-Yang Kao and Xiang-Yang Li, editors, Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, volume 4508 of LNCS, pages 358--367. Springer, 2007. Google ScholarDigital Library
- Xin Han, Deshi Ye, and Yong Zhou. A note on online hypercube packing. Central European Journal of Operations Research, 18:221--239, 2010.Google ScholarCross Ref
- Rolf Harren and Walter Kern. Improved lower bound for online strip packing - (extended abstract). In Roberto Solis-Oba and Giuseppe Persiano, editors, Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, volume 7164 of LNCS, pages 211--218. Springer, 2011. Google ScholarDigital Library
- Johann Hurink and Jacob Jan Paulus. Online scheduling of parallel jobs on two machines is 2-competitive. Operations Research Letters, 36:51--56, 2008. Google ScholarDigital Library
- Johann Hurink and Jacob Jan Paulus. Improved online algorithms for parallel job scheduling and strip packing. Theor. Comput. Sci., 412(7):583--593, 2011. Google ScholarDigital Library
- Zoran Ivkovic and Errol L. Lloyd. A fundamental restriction on fully dynamic maintenance of bin packing. Inf. Process. Lett., 59(4):229--232, 1996. Google ScholarDigital Library
- Berit Johannes. Scheduling parallel jobs to minimize the makespan. Journal of Scheduling, 9:433--452, 2006. Google ScholarDigital Library
- David S. Johnson. Fast algorithms for bin packing. J. Comput. Systems Sci., 8:272--314, 1974. Google ScholarDigital Library
- Walter Kern and Jacob Jan Paulus. A tight analysis of Brown-Baker-Katseff sequences for online strip packing. In Ulrich Faigle, Rainer Schrader, and Daniel Herrmann, editors, Cologne-Twente Workshop (CTW 2010), pages 109--110, 2010.Google Scholar
- C. C. Lee and D. T. Lee. A simple online bin packing algorithm. J. ACM, 32:562--572, 1985. Google ScholarDigital Library
- Frank M. Liang. A lower bound for online bin packing. Inform. Process. Lett., 10:76--79, 1980.Google ScholarCross Ref
- Prakash V. Ramanan, Donna J. Brown, C. C. Lee, and D. T. Lee. Online bin packing in linear time. J. Alg., 10:305--326, 1989. Google ScholarDigital Library
- Steve S. Seiden. On the online bin packing problem. J. ACM, 49(5):640--671, 2002. Google ScholarDigital Library
- Steve S. Seiden and Rob van Stee. New bounds for multi-dimensional packing. Algorithmica, 36(3):261--293, 2003.Google ScholarDigital Library
- Jiõí Sgall. A new analysis of Best Fit bin packing. In Fun with Algorithms, 6th International Conference (FUN 2012), 2012. To appear. Google ScholarDigital Library
- James J. Sylvester. On a point in the theory of vulgar fractions. Amer. J. Math., 3:332--335, 1880.Google ScholarCross Ref
- Gerhard J. Woeginger. Personal communication, 2011.Google Scholar
- Andrew Chi-Chi Yao. New algorithms for bin packing. J. ACM, 27:207--227, 1980. Google ScholarDigital Library
- Deshi Ye, Xin Han, and Guochuan Zhang. A note on online strip packing. J. Comb. Optim., 17(4):417--423, 2009.Google ScholarCross Ref
Index Terms
- SIGACT news online algorithms column 20: the power of harmony
Index terms have been assigned to the content through auto-classification.
Recommendations
SIGACT News Online Algorithms Column 36: 2020 in review
In this column, we will discuss some papers in online algorithms that appeared in 2020. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to ...
SIGACT news online algorithms column 21: APPROX and ALGO
For this column, I would like to report on some conferences that I attended recently, with special attention given (of course) to results in online algorithms. Most of the papers discussed below consider online scheduling, another favorite problem area ...
SIGACT news online algorithms column 24: 2014 so far
In this column, I will discuss some recent papers in online algorithms. It is pleasing to see there were a number of papers about online algorithms in the top conferences this year. If I have missed your paper and you want to write about it or about any ...
Comments