Optimal Multi-Way Search Trees

DOI10.1137/0210031MaRDI QIDQ3911413zbMATH OpenOpenAlexFDO

Authors L. R. Gotlieb

Publication date 1981

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

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

zbMATH Keywords

algorithmoptimal weighted search trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Dynamic programming (90C39)

Cited in

(12)

• Optimal multiway search trees for variable size keys
• Algorithms for minimum length partitions of polygons
• Self-adjusting multi-way search trees
• Heuristics for optimum binary search trees and minimum weight triangulation problems
• Monotonicity and efficient computation of optimal dichotomous search
• Operations research applications of dichotomous search
• On the Huffman and alphabetic tree problem with general cost functions
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• Optimal multiway generalized split trees
• A new algorithm for the construction of optimal B-trees
• A note on optimal multiway split trees
• On the construction of weighted time-optimal B-trees

This page was built for publication: Optimal Multi-Way Search Trees

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