## Optimal Tree Structures for Group Key Management with Batch Updates

- Ronald L. Graham, Minming Li, F. Frances Yao
- SIAM J. Discrete Math.
- 2007

We consider the problem of finding optimal “jumping” patterns from 1 to N where there is a cost associated with each jump. This will be done for two cost functions, in the first case the cost of jumping from a to b will be (1 − q)/a for 0 < q < 1, while the second cost function will be b/a. For the first cost function we will show that all the jump lengths… (More)

Sorry, we couldn't extract any figures or tables for this paper.