On the Huffman and Alphabetic Tree Problem with General Cost Functions - Fujiwara, Hiroshi; Jacobs, Tobias (Algorithmica, 2014)
Keywords: Algorithm Analysis and Problem Complexity; Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Coding, codes; Computer Science; Computer science; control theory; systems; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Exact sciences and technology; Information, signal and communications theory; Mathematics of Computing; Signal and communications theory; Telecommunications and information theory; Theoretical computing; Theory of Computation; Alphabetic tree; Dynamic programming; Binary tree; Huffman coding; Optimal tree; Multi-ary tree; Alphabet; Optimal algorithm; Huffman code; Worst case method; Lossless compression; Minimization; Computational complexity; Minimum time; Prefix code; NP hard problem; Objective function; Variable length code; Monotonicity