Binary trees with choosable edge lengths
References (9)
- et al.
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
(2003) Combinatorial Search
(1988)- C. Bartoschek, S. Held, D. Rautenbach, J. Vygen, Efficient generation of short and fast repeater tree topologies, in:...
- C. Bartoschek, S. Held, D. Rautenbach, J. Vygen, Fast buffering for optimizing worst slack and resource consumption in...
There are more references available in the full text version of this article.
Cited by (2)
Generalized Huffman coding for binary trees with choosable edge lengths
2015, Information Processing LettersThe repeater tree construction problem
2010, Information Processing Letters
Copyright © 2009 Elsevier B.V. All rights reserved.