Establishes a tight double-exponential lower bound for high-multiplicity bin packing parameterized by number of distinct item types d, showing no |I|^{2^{o(d)}} algorithm exists unless ETH fails, via a novel 3-SAT reduction to an ILP with O(log n) variables.
34 Matthias Mnich and René van Bevern
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
Establishes a tight double-exponential lower bound for high-multiplicity bin packing parameterized by number of distinct item types d, showing no |I|^{2^{o(d)}} algorithm exists unless ETH fails, via a novel 3-SAT reduction to an ILP with O(log n) variables.