Papers
Topics
Authors
Recent
Search
2000 character limit reached

Simple and Faster Algorithms for Knapsack

Published 22 Aug 2023 in cs.DS | (2308.11307v1)

Abstract: In this paper, we obtain a number of new simple pseudo-polynomial time algorithms on the well-known knapsack problem, focusing on the running time dependency on the number of items nn, the maximum item weight wmaxw_\mathrm{max}, and the maximum item profit pmaxp_\mathrm{max}. Our results include: - An O~(n3/2⋅min⁡{wmax,pmax})\widetilde{O}(n^{3/2}\cdot \min\{w_\mathrm{max},p_\mathrm{max}\})-time randomized algorithm for 0-1 knapsack, improving the previous O~(min⁡{nwmaxpmax2/3,npmaxwmax2/3})\widetilde{O}(\min\{n w_\mathrm{max} p_\mathrm{max}^{2/3},n p_\mathrm{max} w_\mathrm{max}^{2/3}\}) [Bringmann and Cassis, ESA'23] for the small nn case. - An O~(n+min⁡{wmax,pmax}5/2)\widetilde{O}(n+\min\{w_\mathrm{max},p_\mathrm{max}\}^{5/2})-time randomized algorithm for bounded knapsack, improving the previous O(n+min⁡{wmax3,pmax3})O(n+\min\{w_\mathrm{max}^3,p_\mathrm{max}^3\}) [Polak, Rohwedder and Wegrzyck, ICALP'21].

Authors (2)
Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.