On the linear description of the Huffman trees polytope
DOI10.1016/j.dam.2012.05.004zbMath1321.05047OpenAlexW2011007473MaRDI QIDQ496665
Jean-Francois Maurras, Viet Hung Nguyen, Thanh Hai Nguyen
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.004
polytopescombinatorial optimizationhyperplanecombinatorial inequalitiesFibonacci sequencebinary treespolyhedral combinatoricsHuffman treeHuffman coding
Trees (05C05) Combinatorial optimization (90C27) Combinatorial inequalities (05A20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Cites Work
This page was built for publication: On the linear description of the Huffman trees polytope