Bounding Fan-out in Logical Networks
Journal of the ACM (JACM)
Generalized Shannon Code Minimizes the Maximal Redundancy
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Combinatorial Merging and Huffman's Algorithm
IEEE Transactions on Computers
IEEE Transactions on Computers
The repeater tree construction problem
Information Processing Letters
Precise minimax redundancy and regret
IEEE Transactions on Information Theory
Minimax trees in linear time with applications
European Journal of Combinatorics
| Hi-index | 0.04 |
In the binary minimax tree problem we are given non-negative weights W=(w"1,...,w"n). The task is to find a rooted binary tree T with n leaves and an assignment of the leaves to the weights such that the maximum over all leaves l of the weight of l plus the depth of l is minimized. We present an online algorithm for building an optimal binary minimax tree with integral weights that runs in O(nlogn/loglogn) time using exponential search trees. Moreover, we show that no online algorithm computing an optimal minimax tree exists if we allow non-integral real weights.