Minimax Trees in Linear Time with Applications [chapter]

Paweł Gawrychowski, Travis Gagie
2009 Lecture Notes in Computer Science  
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
more » ... orithm for building minimax trees for unsorted real weights.
doi:10.1007/978-3-642-10217-2_28 fatcat:ljkp7az66zeztmfhwgbjpcwcsa