Parallel Online Algorithms for the Bin Packing Problem

Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt 0001. Parallel Online Algorithms for the Bin Packing Problem. In Evripidis Bampis, Nicole Megow, editors, Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers. Volume 11926 of Lecture Notes in Computer Science, pages 106-119, Springer, 2019. [doi]

@inproceedings{FeketeGK019,
  title = {Parallel Online Algorithms for the Bin Packing Problem},
  author = {Sándor P. Fekete and Jonas Grosse-Holz and Phillip Keldenich and Arne Schmidt 0001},
  year = {2019},
  doi = {10.1007/978-3-030-39479-0_8},
  url = {https://doi.org/10.1007/978-3-030-39479-0_8},
  researchr = {https://researchr.org/publication/FeketeGK019},
  cites = {0},
  citedby = {0},
  pages = {106-119},
  booktitle = {Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers},
  editor = {Evripidis Bampis and Nicole Megow},
  volume = {11926},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-39479-0},
}