arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.2868cs.DS
收藏

线性时间上的极大极小树

Minimax Trees in Linear Time

Pawel Gawrychowski, Travis Gagie

摘要:

极大极小树类似于霍夫曼树,除了它不是最小化叶子深度的加权平均值,而是最小化任何叶子的权重加上它的深度的最大值。Golumbic(1976)引入了极大极小树,并给出了一个类似Huffman的$\Oh{n \log n}$时间算法来构建它们。Drmota和Szpankowski(2002)给出了另一个$\Oh{n \log n}$-时间算法,该算法在二分搜索的每一步都检查Kraft不等式。在本文中,我们展示了如何Drmota和Szpankowski的算法可以运行在一个字RAM(Ω(\log n))位字的线性时间。我们也讨论我们的解决方案如何适用于数据压缩,组测试和电路设计中的问题。

英文摘要:

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, $\Oh{n \log n}$-time algorithm for building them. Drmota and Szpankowski (2002) gave another $\Oh{n \log n}$-time algorithm, which checks the Kraft Inequality in each step of a binary search. In this paper we show how Drmota and Szpankowski's algorithm can be made to run in linear time on a word RAM with (Ω(\log n))-bit words. We also discuss how our solution applies to problems in data compression, group testing and circuit design.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑