On an Optimal Split Tree Problem
Authors:
- Ryan BorgstromRBRyan Borgstrom
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 157-168
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Elements of Information Theory2001
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary TreesSIAM Journal on Computing, 1994
- A new proof of the Garsia-Wachs algorithmJournal of Algorithms, 1988
- Height Restricted Optimal Binary TreesSIAM Journal on Computing, 1987
- A New Algorithm for Minimum Cost Binary TreesSIAM Journal on Computing, 1977
- Optimal Alphabetic TreesSIAM Journal on Computing, 1976
- Optimal Binary Search Trees with Restricted Maximal DepthSIAM Journal on Computing, 1974
- Reducibility among Combinatorial Problems1972
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- Optimum binary search treesActa Informatica, 1971