A New Algorithm for Building Alphabetic Minimax Trees

Simple item page
dc.creatorGagie, Travis
dc.date2008-10-28
dc.date.accessioned2026-07-07T10:13:40Z
dc.date.available2026-07-07T10:13:40Z
dc.descriptionWe show how to build an alphabetic minimax tree for a sequence (W = w_1, >..., w_n) of real weights in (O (n d \log \log n)) time, where $d$ is the number of distinct integers (\lceil w_i \rceil). We apply this algorithm to building an alphabetic prefix code given a sample.
dc.descriptionin preparation
dc.identifierhttps://arxiv.org/abs/0810.5064
dc.identifierhttp://arxiv.org/abs/0810.5064
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172610
dc.subjectInformation Theory
dc.subjectData Structures and Algorithms
dc.titleA New Algorithm for Building Alphabetic Minimax Trees
dc.typetext

Files

Collections

arXiv