On the Huffman and Alphabetic Tree Problem with General Cost Functions
From MaRDI portal
Publication:3586484
DOI10.1007/978-3-642-15775-2_38zbMath1287.68073OpenAlexW1497106265MaRDI QIDQ3586484
Hiroshi Fujiwara, Tobias Jacobs
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (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
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: On the Huffman and Alphabetic Tree Problem with General Cost Functions