Minimax Trees in Linear Time with Applications

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.

• Type: Conference
• Year: 2009
• Where: IWOCA
• Authors: Pawel Gawrychowski, Travis Gagie
• Keywords: Algorithms, IWOCA 2009, Log N)-time Algorithm, Minimax Trees, first Linear-time Algorithm