Construction of Optimal \alpha -\beta Leaf Trees with Applications to Prefix Code and Information Retrieval

DOI10.1137/0212028zbMATH Open0525.68069OpenAlexW2093693833MaRDI QIDQ3038664FDOQ3038664

Author name not available (Why is that?)

Publication date: 1983

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

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

zbMATH Keywords

combinatorial optimizationanalysis of algorithmsprefix codingleaf treesoptimal trees

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Prefix, length-variable, comma-free codes (94A45) Data structures (68P05)

Cited In (1)

• Operations research applications of dichotomous search

This page was built for publication: Construction of Optimal $\alpha $-$\beta $ Leaf Trees with Applications to Prefix Code and Information Retrieval

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