On the Huffman and alphabetic tree problem with general cost functions

DOI10.1007/s00453-013-9755-6zbMath1300.90059OpenAlexW2908475712MaRDI QIDQ2249740

Hiroshi Fujiwara, Tobias Jacobs

Publication date: 3 July 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://soar-ir.repo.nii.ac.jp/record/19568/files/On_the_Huffman_and_Alphabetic_Tree_Problem_with_General_Cost_Functions.pdf

zbMATH Keywords

dynamic programmingbinary treeHuffman codingoptimal treealphabetic treemulti-ary tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items

Operations research applications of dichotomous search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in random partially ordered sets
• Alphabetic coding with exponential costs
• Optimal alphabetic search trees with restricted maximal height
• Correctness of constructing optimal alphabetic trees revisited
• Greedy splitting algorithms for approximating multiway partition problems
• Optimum binary search trees
• Should Static Search Trees Ever Be Unbalanced?
• Decision trees for entity identification
• Approximating Optimal Binary Decision Trees
• On the Complexity of Searching in Trees: Average-Case Minimization
• Approximating Decision Trees with Multiway Branches
• Height Restricted Optimal Binary Trees
• Optimal Multi-Way Search Trees
• Optimal Alphabetic Trees
• A New Algorithm for Minimum Cost Binary Trees
• Binary Trees Optimum Under Various Criteria
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Algorithms – ESA 2005
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• A New Proof of the T-C Algorithm

This page was built for publication: On the Huffman and alphabetic tree problem with general cost functions