English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Faster Knapsack Algorithms via Bounded Monotone 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-ICALP-2022-31.pdf
(Publisher version), 880KB

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

Bringmann, K., & Cassis, A. (2022). Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. In M. Bojańczyk, E. Merelli, & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming (pp. 1-21). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2022.31.


Cite as: https://hdl.handle.net/21.11116/0000-000B-1622-6
Abstract
There is no abstract available