e/Package-merge algorithm

Information
has gloss	eng: The Package-Merge Algorithm is an O(nL)-time algorithm for finding an optimal length-limited Huffman code for a given distribution on a given alphabet of size n, where no code word is longer than L. It is a greedy algorithm, and a generalization of Huffmans original algorithm. Package-merge works by reducing the code construction problem to the binary Coin Collectors problem.
lexicalization	eng: package-merge algorithm
instance of	e/Lossless data compression