A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

DOI10.1137/S0097539792231167zbMath0834.68020OpenAlexW2001155924WikidataQ29027665 ScholiaQ29027665MaRDI QIDQ4327425

Lawrence L. Larmore, Teresa M. 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

optimal alphabetic binary treealphabetic package merge algorithms

Mathematics Subject Classification ID

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

Related Items (4)

Operations research applications of dichotomous search ⋮ Analytical aspects of tie breaking ⋮ The Optimal Alphabetic Tree problem revisited ⋮ On the Huffman and alphabetic tree problem with general cost functions

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