Pages that link to "Item:Q2512825"
From MaRDI portal
The following pages link to Generalized Huffman coding for binary trees with choosable edge lengths (Q2512825):
Displaying 4 items.
- On the linear description of the Huffman trees polytope (Q496665) (← links)
- Binary trees with choosable edge lengths (Q989581) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees (Q5958114) (← links)