Pages that link to "Item:Q2249740"
From MaRDI portal
The following pages link to On the Huffman and alphabetic tree problem with general cost functions (Q2249740):
Displaying 6 items.
- On the linear description of the Huffman trees polytope (Q496665) (← links)
- Optimal alphabetic binary tree for a nonregular cost function (Q800733) (← links)
- Minimal Huffman trees (Q1567200) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Generalized Huffman coding for binary trees with choosable edge lengths (Q2512825) (← links)
- Partial alphabetic trees (Q5468863) (← links)