English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Nederlof, Jesper1, Author
Pawlewicz, Jakub1, Author
Swennenhuis, Céline M. F.1, Author
Węgrzycki, Karol2, Author                 
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20232023
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Nederlof2023
DOI: 10.1137/22M1478112
 Degree: -

Event

show

Legal Case

show

Project information

show hide
Project name : CRACKNP
Grant ID : 853234
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)
Project name : TIPEA
Grant ID : 850979
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)
Project name : TOTAL
Grant ID : 677651
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)

Source 1

show
hide
Title: SIAM Journal on Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Philadelphia : SIAM
Pages: - Volume / Issue: 52 (6) Sequence Number: - Start / End Page: 1369 - 1412 Identifier: ISSN: 0097-5397
CoNE: https://pure.mpg.de/cone/journals/resource/954925466249