The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes (Q2706116)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes |
scientific article |
Statements
19 March 2001
0 references
prefix codes
0 references
Huffman trees
0 references
Lagrangian duality
0 references
approximative algorithm
0 references
The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes (English)
0 references
An approximative algorithm that constructs length restricted prefix codes is presented. The algorithm, called WARM-UP, is based on Lagrangian relaxation. Two interesting implementations with good time complexities are discussed. See also \textit{R. Milidiú} and \textit{E. Laber} [LATIN 2000, Lect. Notes Comput. Sci. 1776, 227-236 (2000; Zbl 0984.94025)] for a linear time algorithm to recognize an optimal length restricted prefix codes.
0 references
