Title of article
THE CONSTRUCTION OF HUFFMAN CODES IS A SUBMODULAR ("CONVEX") OPTIMIZATION PROBLEM OVER A LATTICE OF BINARY TREES
Author/Authors
PARKER، D. STOTT نويسنده , , RAM، PRASAD نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-1874
From page
1875
To page
0
Abstract
This paper describes the potential suitability of a new family of concrete mixtures for use in protective structures. Two very-high-strength concrete mixtures are discussed and experimental results of penetration studies on one of these are presented. The results are compared to penetration-study results of other, more conventional concrete mixtures, and the advantages of the very-high-strength mixtures are described.
Keywords
enumeration of trees , combinatorial optimization , adaptive coding , Dynamic Programming , lattices , Convexity , prefix codes , greedy algorithms , submodular functions , Moebius inversion , Schur convex functions , Entropy , Fortuin-Kasteleyn-Ginibre(FKG) inequality , combinatorial inequalities , majorization , quadrangle inequality , Huffman coding , Monge matrices , tree imbalance
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16615
Link To Document