The Optimal Alphabetic Tree Problem Revisited

DOI10.1006/JAGM.1998.0934MaRDI QIDQ4216143zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, Teresa Przytycka

Publication date 21 October 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1006/jagm.1998.0934

zbMATH Keywords

OABT problem

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The Optimal Alphabetic Tree problem revisited
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 437543
• Testing the optimality of alphabetic trees

Cited in

(10)

• Correctness of constructing optimal alphabetic trees revisited
• Operations research applications of dichotomous search
• On the Huffman and alphabetic tree problem with general cost functions
• On the size of the smallest alphabet for Lyndon trees
• Optimal alphabetic trees for binary search
• scientific article; zbMATH DE number 1947386 (Why is no real title available?)
• The Optimal Alphabetic Tree problem revisited
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees
• Optimal binary search trees
• Old and new results on alphabetic codes

This page was built for publication: The Optimal Alphabetic Tree Problem Revisited

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