Online binary minimax trees

DOI10.1016/J.DAM.2013.05.033MaRDI QIDQ2444549zbMATH OpenOpenAlexFDO

Authors Jens Maßberg

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

zbMATH Keywords

Huffman codingkraft inequalityminimax treesonline algorithms

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Recommendations

• Minimax Trees in Linear Time with Applications
• Minimax trees in linear time with applications
• On binary search trees
• Alphabetic minimax trees in linear time
• Alphabetic Minimax Trees

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• Alphabetic Minimax Trees
• Binary Trees Optimum Under Various Criteria
• Bounding Fan-out in Logical Networks
• Combinatorial Merging
• Combinatorial Merging and Huffman's Algorithm
• Dynamic ordered sets with exponential search trees
• scientific article; zbMATH DE number 2086237 (Why is no real title available?)
• Minimax trees in linear time with applications
• Precise Minimax Redundancy and Regret
• The repeater tree construction problem

Cited in

(1)

• Minimax trees in linear time with applications

This page was built for publication: Online binary minimax trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444549)