A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of 
Bins via Additive Combinatorics

Nederlof, Jesper; Pawlewicz, Jakub; Swennenhuis, Céline M. F.; Węgrzycki, Karol

doi:10.1137/22M1478112

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

MPS-Authors

/persons/resource/persons252863

Węgrzycki, Karol
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Nederlof, J., Pawlewicz, J., Swennenhuis, C. M. F., & Węgrzycki, K. (2023). A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM Journal on Computing, 52(6), 1369-1412. doi:10.1137/22M1478112.

Cite as: https://hdl.handle.net/21.11116/0000-000E-36A8-8

Abstract

There is no abstract available