𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the growth of random knapsacks

✍ Scribed by John W. Mamer; Kenneth E. Schilling

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
392 KB
Volume
28
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the supermodular knapsack problem
On the supermodular knapsack problem
✍ G. Gallo; B. Simeone πŸ“‚ Article πŸ“… 1989 πŸ› Springer-Verlag 🌐 English βš– 631 KB
A note on the growth of random trees
A note on the growth of random trees
✍ J.D. Biggins; D.R. Grey πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 200 KB

We provide a unification and generalization of several recent results on the asymptotics, as the number of nodes increases, of the heights of trees grown according to various rules.