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 , the maximum item weight , and the maximum item profit . Our results include: - An -time randomized algorithm for 0-1 knapsack, improving the previous [Bringmann and Cassis, ESA'23] for the small case. - An -time randomized algorithm for bounded knapsack, improving the previous [Polak, Rohwedder and Wegrzyck, ICALP'21].
Paper Prompts
Sign up for free to create and run prompts on this paper.