𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

✍ Scribed by Yunpeng Pan; Leyuan Shi

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
220 KB
Volume
110
Category
Article
ISSN
0025-5610

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

Lower Bounds for the Union–Find and the
Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines
✍ Han La PoutrΓ© πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 490 KB

A well-known result of Tarjan states that for all n and m n there exists a sequence of n&1 Union and m Find operations that needs at least 0(m . :(m, n)) execution steps on a pointer machine that satisfies the separation condition. Later the bound was extended to 0(n+m. :(m, n)) for all m and n. In