𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The online knapsack problem: Advice and randomization

✍ Scribed by Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Rossmanith, Peter

Book ID
122230446
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
289 KB
Volume
527
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A relation between the knapsack and grou
A relation between the knapsack and group knapsack problems
✍ Nan Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 888 KB

In this paper, we investigate a relation between the equality constrained Knapsack and Group Knapsack problems. This relation concerns the periodicity of optimal solutions of the Knapsack problem. We study the smallest integer b\* such that for every b > b\*, the Knapsack problem of size b is equiva

Factoring Polynomials and the Knapsack P
Factoring Polynomials and the Knapsack Problem
✍ Mark van Hoeij 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 222 KB

For several decades the standard algorithm for factoring polynomials f with rational coefficients has been the Berlekamp-Zassenhaus algorithm. The complexity of this algorithm depends exponentially on n, where n is the number of modular factors of f . This exponential time complexity is due to a com

A lower time bound for the knapsack prob
A lower time bound for the knapsack problem on random access machines
✍ Peter Klein; Friedhelm Meyer Heide 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 533 KB

a.M. (Fed. Rep.) Summary. We consider random access machines which read the input integer by integer (not bit by bit). For this computational model we prove a quadratic lower bound for the n-dimensional knapsack problem. For this purpose, we combine a method due to Paul and Simon [1] to apply decisi