Minimax Trees in Linear Time

Details Minimax Trees in Linear Time Minimax Trees in Linear Time

2008-12-15

arxiv.org/abs/0812.2868v2

Computer Science

Data Structures and Algorithms

Scientific paper

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 (\Omega (\log n))-bit words. We also discuss how our solution applies to problems in data compression, group testing and circuit design.

Affiliated with

Also associated with

No associations

Rating

Minimax Trees in Linear Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimax Trees in Linear Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimax Trees in Linear Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349733