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.

Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling

Karl Bringmann, Anita Dürr, Karol Wegrzycki. Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling. In Aditya Bhaskara, Artur Czumaj, editors, Proceedings of the 58th Annual ACM Symposium on Theory of Computing, STOC 2026, Salt Lake City, UT, USA, June 22-26, 2026. pages 2094-2105, ACM, 2026. [doi]

Authors

Karl Bringmann

This author has not been identified. Look up 'Karl Bringmann' in Google

Anita Dürr

This author has not been identified. Look up 'Anita Dürr' in Google

Karol Wegrzycki

This author has not been identified. Look up 'Karol Wegrzycki' in Google
runs on