A polynomial linear search algorithm for the n-dimensional knapsack problem

Authors:
Friedhelm Meyer auf der Heide
Affiliations:
-
Venue:
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Year:
1983

Citing 2
Cited 0

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On the parallel computation for the knapsack problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a Linear Search Algorithm which decides the n-dimensional knapsack problem in n4log(n) + 0.(n3) steps. This algorithm works for inputs consisting of n numbers for some arbitrary but fixed integer n. This result solves an open problem posed for example in [6] and [7] by Dobkin / Lipton and A.C.C. Yao, resp.. It destroys the hope of proving large lower bounds for this NP-complete problem in the model of Linear Search Algorithms.