DagSemProc.09281.4.pdf
- Filesize: 190 kB
- 11 pages
Document
Minimax Trees in Linear Time with Applications
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9281
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-11-10
Cite AsGet BibTex
Pawel Gawrychowski and Travis Gagie. Minimax Trees in Linear Time with Applications. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09281.4
https://doi.org/10.4230/DagSemProc.09281.4
Abstract
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.
Keywords
- Data structures
- data compression
- prefix-free coding
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads