Journal of the ACM Bibliography
Andrew Chi-Chih Yao. New
algorithms for bin packing. Journal of the ACM,
27(2):207-227, April 1980.
[BibTeX entry]
Selected papers that cite this one
- Yossi Azar and Leah Epstein. On two dimensional
packing. Journal of Algorithms, 25(2):290-310, November
1997.
- Raymond A. Board. The online
graph bandwidth problem. Information and Computation,
100(2):178-201, October 1992.
- Zoran Ivkovi\'c and Errol L. Lloyd. Partially dynamic bin
packing can be solved within 1 + \epsilon in (amortized) polylogarithmic
time. Information Processing Letters, 63(1):45-50, 14
July 1997.
- Zoran Ivkovi\'c and Errol L. Lloyd. A fundamental
restriction on fully dynamic maintenance of bin packing.
Information Processing Letters, 59(4):229-232, 26 August
1996.
- David S. Johnson and Michael R. Garey. A 71/60 theorem for
bin packing. Journal of Complexity, 1(1):65-106,
October 1985.
- Gerhard J. Woeginger. There is no asymptotic
PTAS for two-dimensional vector packing. Information
Processing Letters, 64(6):293-297, 29 December 1997.
Shortcuts: