External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Sándor P. Fekete

This author has not been identified. Look up 'Sándor P. Fekete' in Google

Jonas Grosse-Holz

This author has not been identified. Look up 'Jonas Grosse-Holz' in Google

Phillip Keldenich

This author has not been identified. Look up 'Phillip Keldenich' in Google

Arne Schmidt 0001

This author has not been identified. Look up 'Arne Schmidt 0001' in Google
runs on