Abstract
Heuristics for optimal binary search trees with zero key access probabilities (with applications eg. in code theory and in point location) are considered. It is shown that for an arbitrarily small positive constant ∈, there exists a linear-time heuristic for such search trees, producing solutions within the factor of 1+∈ from the optimum. Also, by using an interesting amortization argument, we give a simple and practical, linear-time implementation of a known greedy heuristic for such trees. The above results are obtained in a more general setting, namely in the context of minimum length triangulations of so-called semi-circular polygons. They are carried over to binary search trees by proving a duality between minimum weight partitions of infinitely-flat semi-circular polygons into m-gons and optimal (m−1)-way search trees. Our results can be extended to the case with non-zero key access probabilities, and to multi-way search trees.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T.C. Hu and A.C. Tucker, Optimal Computer Search Trees and Variable-Length Alpha-betical Codes, SIAM J. Applied Math. 21, pp. 514–532.
A.M. Garsia and M.L. Wachs, A new algorithm for minimum cost binary trees, SICOMP 4, 622–642.
P.D. Gilbert, New Results in Planar Triangulations, M.S. Thesis, Coordinated Science Laboratory, University of Illinois, Urbana, Illinois.
L. Gotlieb, Optimal Multi-way Search Trees, SIAM J. Comput. vol. 10, No. 3
G.T. Klincsek, Minimal triangulations of polygonal domains, Ann. Discrete Math., vol. 9, pp. 121–123.
D.E. Knuth, The Art of Computer Programming 3: Sorting and Searching, Addison-Wesley, Reading Massachusetts.
C. Levcopoulos, New Results about the Approximation Behavior of the Greedy Triangulation, Linköping Studies in Science and Technology, Thesis No 74.
C. Levcopoulos, New Heuristics for Constructing Optimal Search Trees (in preparation).
A. Lingas, The Greedy Triangulation Heuristic for Minimum Weight Triangulation of Convex Polygons Approximates the Optimum, research report, LITH-IDA-R86-11, Linköping University.
C. Levcopoulos and A. Lingas, On Approximation Behavior of the Greedy Triangulation for Convex Polygons, to appear in Algorithmica.
C. Levcopoulos, A. Lingas and J. Sack, Nearly Optimal Heuristics for Binary Search Trees and their Geometric Generalizations, technical report, Linköping University, 1987.
A. Lingas, C. Levcopoulos and J. Sack, Optimal Algorithms for Minimum Length Partitions of Polygons, submitted to BIT.
D.T. Lee and F.P. Preparata, The all nearest neighbor problem for convex polygons, Information Processing Letters, vol. 7, no. 4, pp. 189–192.
K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Spring. Verlag, Heidelberg.
F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction, Texts and Monographs in Computer Science, Spring. Verlag, New York.
D.D. Sleator, R.E. Tarjan and W.P. Thurston, Rotation Distance, Triangulations, and Hyperbolic Geometry, Proc. of the 18th ACM Symposium on Theory of Computing, Berkley, California.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levcopoulos, C., Lingas, A., Sack, JR. (1987). Nearly optimal heuristics for binary search trees with geometric generalizations. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_32
Download citation
DOI: https://doi.org/10.1007/3-540-18088-5_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18088-3
Online ISBN: 978-3-540-47747-1
eBook Packages: Springer Book Archive