0-1 Knapsack in Nearly Quadratic Time
We study pseudo-polynomial time algorithms for the fundamental 0- 1 Knapsack problem. Recent research interest has focused on its finegrained complexity with respect to the number of items 𝑛 and the maximum item weight 𝑤max. Under (min, +)-convolution hypothesis, 0-1 Knapsack does not have𝑂( (𝑛+𝑤m...
Main Author: | Jin, Ce |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing
2024
|
Online Access: | https://hdl.handle.net/1721.1/155707 |
Similar Items
-
A Nearly Quadratic Improvement for Memory Reallocation
by: Farach-Colton, Martin, et al.
Published: (2024) -
Knapsack-based reverse influence maximization for target marketing in social networks
by: Talukder, Ashis, et al.
Published: (2019) -
Time-inconsistent stochastic linear-quadratic control in continuous time
by: Song, Wan Jing
Published: (2021) -
Gravitation and quadratic forms
by: Ananth, Sudarshan, et al.
Published: (2018) -
Multirate Linear Quadratic Gaussian controllers for linear time-invariant systems
by: Chua, Say Yong.
Published: (2009)