Pages that link to "Item:Q4538082"
From MaRDI portal
The following pages link to Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (Q4538082):
Displayed 4 items.
- Dynamic Shannon coding (Q845979) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Generalized Huffman coding for binary trees with choosable edge lengths (Q2512825) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768) (← links)