2026-07-20T04:50:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2242 2024-03-06T11:08:52Z ddc:004 open_access

Minimax Trees in Linear Time with Applications Gawrychowski, Pawel Gagie, Travis Data structures data compression prefix-free coding 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Pawel Gawrychowski and Travis Gagie 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09281.4 urn:nbn:de:0030-drops-22421 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.4 eng https://creativecommons.org/licenses/by/4.0/legalcode