The Optimal Alphabetic Tree Problem Revisited

DOI10.1006/jagm.1998.0934zbMath0919.68094OpenAlexW1989402077MaRDI QIDQ4216143

Lawrence L. Larmore, Teresa M. Przytycka

Publication date: 21 October 1998

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

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

zbMATH Keywords

OABT problem

Mathematics Subject Classification ID

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

Related Items (3)

Operations research applications of dichotomous search ⋮ Correctness of constructing optimal alphabetic trees revisited ⋮ Optimal binary search trees

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