English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons263580

Cassis,  Alejandro
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)

LIPIcs.ESA.2023.24.pdf
(Publisher version), 2MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., & Cassis, A. (2023). Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. In I. L. Gørtz, M. Farach-Colton, S. J. Puglisi, & G. Herman (Eds.), 31st Annual European Symposium on Algorithms (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2023.24.


Cite as: https://hdl.handle.net/21.11116/0000-0010-3502-0
Abstract
There is no abstract available