Online binary minimax trees
From MaRDI portal
Publication:2444549
DOI10.1016/j.dam.2013.05.033zbMath1285.05032MaRDI QIDQ2444549
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.033
05C05: Trees
68P10: Searching and sorting
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
68W27: Online algorithms; streaming algorithms
Cites Work
- Unnamed Item
- The repeater tree construction problem
- Minimax trees in linear time with applications
- Bounding Fan-out in Logical Networks
- Dynamic ordered sets with exponential search trees
- Precise Minimax Redundancy and Regret
- Alphabetic Minimax Trees
- Combinatorial Merging
- Combinatorial Merging and Huffman's Algorithm
- Binary Trees Optimum Under Various Criteria
- A Method for the Construction of Minimum-Redundancy Codes