The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem over a Lattice of Binary Trees

Autor: Parker, D. Stott, Ram, Prasad
Zdroj: SIAM Journal on Computing. 1999, Vol. 28 Issue 5, p1875. 31p.
Databáze: Business Source Ultimate