Minimax Trees in Linear Time

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-349733

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.