On the cost of optimal alphabetic code trees with unequal letter costs

DOI10.1016/J.EJC.2007.02.014MaRDI QIDQ2472833zbMATH OpenOpenAlexFDO

Authors Dieter Rautenbach, Christian Szegedy, Jürgen Werber

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Cites work

• scientific article; zbMATH DE number 1219592 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A DICHOTOMOUS SEARCH WITH TRAVEL COST
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Binary Trees Optimum Under Various Criteria
• Code and parse trees for lossless source encoding
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times
• On dichotomous search with direction-dependent costs for a uniformly hidden object
• Optimal Alphabetic Trees
• Optimum lopsided binary trees
• Recurrence relations based on minimization
• Recurrence relations based on minimization and maximization
• The delay of circuits whose inputs have specified arrival times

Cited in

(1)

• Fast prefix adders for non-uniform input arrival times

This page was built for publication: On the cost of optimal alphabetic code trees with unequal letter costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472833)