eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2009-11-10
1
11
10.4230/DagSemProc.09281.4
article
Minimax Trees in Linear Time with Applications
Gawrychowski, Pawel
Gagie, Travis
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves' depths, it minimizes the maximum of any leaf's weight plus its depth. Golumbic (1976) introduced minimax trees and gave a Huffman-like, $O (n log n)$-time algorithm for building them. Drmota and Szpankowski (2002) gave another $O (n log n)$-time algorithm, which takes linear time when the weights are already sorted by their fractional parts. In this paper we give the first linear-time algorithm for building minimax trees for unsorted real weights.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol09281/DagSemProc.09281.4/DagSemProc.09281.4.pdf
Data structures
data compression
prefix-free coding