On the cost of optimal alphabetic code trees with unequal letter costs
From MaRDI portal
Publication:2472833
DOI10.1016/j.ejc.2007.02.014zbMath1130.68064MaRDI QIDQ2472833
Jürgen Werber, Dieter Rautenbach, Christian Szegedy
Publication date: 25 February 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.02.014
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times
- Recurrence relations based on minimization and maximization
- Recurrence relations based on minimization
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Code and parse trees for lossless source encoding
- The delay of circuits whose inputs have specified arrival times
- Optimal Alphabetic Trees
- A DICHOTOMOUS SEARCH WITH TRAVEL COST
- Binary Trees Optimum Under Various Criteria
- Optimum lopsided binary trees
- On dichotomous search with direction-dependent costs for a uniformly hidden object