An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing

Steven S. Seiden. An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 283-295, Springer, 2000. [doi]

@inproceedings{Seiden00:0,
  title = {An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing},
  author = {Steven S. Seiden},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1853/18530283.htm},
  researchr = {https://researchr.org/publication/Seiden00%3A0},
  cites = {0},
  citedby = {0},
  pages = {283-295},
  booktitle = {Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  editor = {Ugo Montanari and José D. P. Rolim and Emo Welzl},
  volume = {1853},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67715-1},
}