On the linear description of the Huffman trees polytope
DOI10.1016/J.DAM.2012.05.004zbMATH Open1321.05047OpenAlexW2011007473MaRDI QIDQ496665FDOQ496665
Authors: Jean-François Maurras, Thanh Hai Nguyen, Viet Hung 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
Recommendations
- On the convex hull of Huffman trees
- Publication:3027031
- Computing and Combinatorics
- scientific article; zbMATH DE number 4031716
- The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions
- On the Huffman and alphabetic tree problem with general cost functions
- On the Huffman and alphabetic tree problem with general cost functions
- Optimal Skeleton Huffman Trees Revisited
- Generalized Huffman coding for binary trees with choosable edge lengths
combinatorial optimizationbinary treespolyhedral combinatoricsFibonacci sequencepolytopeshyperplaneHuffman codingcombinatorial inequalitiesHuffman tree
Information storage and retrieval of data (68P20) Trees (05C05) Combinatorial optimization (90C27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial inequalities (05A20)
Cites Work
- Constructing extended formulations from reflection relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adjacent Vertices on a Permutohedron
- An Inequality
- The permutahedron of series-parallel posets
- The permutahedron of series-parallel posets
- Facets of the generalized permutahedron of a poset
Cited In (4)
This page was built for publication: On the linear description of the Huffman trees polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496665)
