A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

DOI10.1137/S0097539792231167MaRDI QIDQ4327425zbMATH OpenOpenAlexWikidataFDO

Authors Lawrence L. Larmore, Teresa Przytycka

Publication date 6 April 1995

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792231167

zbMATH Keywords

alphabetic package merge algorithmsoptimal alphabetic binary tree

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• The Optimal Alphabetic Tree problem revisited
• A parallel algorithm for optimum height-limited alphabetic binary trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• scientific article; zbMATH DE number 437543
• A fast algorithm for optimal length-limited Huffman codes

Cited in

(19)

• Operations research applications of dichotomous search
• A parallel algorithm for optimum height-limited alphabetic binary trees
• Analytical aspects of tie breaking
• On the Huffman and alphabetic tree problem with general cost functions
• The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes
• Optimal alphabetic trees for binary search
• scientific article; zbMATH DE number 437543 (Why is no real title available?)
• A fast algorithm for optimal length-limited Huffman codes
• Height Restricted Optimal Binary Trees
• Bounding the depth of search trees
• The Optimal Alphabetic Tree problem revisited
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees
• An optimal, purely functional implementation of the Garsia-Wachs algorithm
• Partial alphabetic trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Path Length of Binary Search Trees
• A New Proof of the T-C Algorithm
• Old and new results on alphabetic codes
• Binary search trees of almost optimal height

This page was built for publication: A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

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