A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Work
Year: 2023
Type: article
Abstract: In the Bin Packing problem one is given items with weights and bins with capacities . The goal is to partition the items into sets such that for every bin , where denotes . Björklund, Husfeldt, and Ko... more
Source: SIAM Journal on Computing
Institutions Utrecht University, University of Warsaw, Eindhoven University of Technology, Max Planck Institute for Informatics, Saarland University
Cites: 34
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funders Fundacja na rzecz Nauki Polskiej, Fundacja na rzecz Nauki Polskiej, European Research Council, European Research Council
Grant IDS 2016/21/N/ST6/01468, 2018/28/T/ST6/00084, 677651, 850979