Faster knapsack algorithms via bounded monotone min-plus-convolution

From MaRDI portal

Publication:6560817

Jump to:navigation, search

DOI10.4230/lipics.icalp.2022.31MaRDI QIDQ6560817

Unnamed Author, Karl Bringmann

Publication date: 24 June 2024

zbMATH Keywords

approximation schemes knapsack fine-grained complexity min-plus convolution

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

This page was built for publication: Faster knapsack algorithms via bounded monotone min-plus-convolution

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6560817&oldid=40089332"