Fast Algorithms for Knapsack via Convolution and Prediction

11/30/2018
by   MohammadHossein Bateni, et al.
0

The knapsack problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to pack a knapsack of size t with the maximum value from a collection of n items with given sizes and values. Recent evidence suggests that a classic O(nt) dynamic-programming solution for the knapsack problem might be the fastest in the worst case. In fact, solving the knapsack problem was shown to be computationally equivalent to the (, +) convolution problem, which is thought to be facing a quadratic-time barrier. This hardness is in contrast to the more famous (+, ·) convolution (generally known as polynomial multiplication), that has an O(n n)-time solution via Fast Fourier Transform. Our main results are algorithms with near-linear running times (in terms of the size of the knapsack and the number of items) for the knapsack problem, if either the values or sizes of items are small integers. More specifically, if item sizes are integers bounded by , the running time of our algorithm is Õ((n+t)). If the item values are integers bounded by , our algorithm runs in time Õ(n+t). Best previously known running times were O(nt), O(n^2) and O(n) (Pisinger, J. of Alg., 1999).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2021

Knapsack and Subset Sum with Small Items

Knapsack and Subset Sum are fundamental NP-hard problems in combinatoria...
research
07/24/2023

Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results

We investigate pseudopolynomial-time algorithms for Bounded Knapsack and...
research
08/06/2023

Knapsack with Small Items in Near-Quadratic Time

The Bounded Knapsack problem is one of the most fundamental NP-complete ...
research
07/16/2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time

Knapsack problems are among the most fundamental problems in optimizatio...
research
05/28/2020

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size

In view of the undisputed success of neural networks and due to the rema...
research
05/02/2023

Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution

We revisit the classic 0-1-Knapsack problem, in which we are given n ite...
research
07/31/2016

An exact, cache-localized algorithm for the sub-quadratic convolution of hypercubes

Fast multidimensional convolution can be performed naively in quadratic ...

Please sign up or login with your details

Forgot password? Click here to reset