Abstract
In a paper in Journal of Algorithms, Vol.13, (1992), p.148-160, Hirschberg and Larmore introduced the traveler’s problem as a subroutine for constructing the B-tree. They gave an O(n5/3 log1/3n) time algorithm for solving traveler’s problem of size n. In this paper, we improve their time bound to O(n3/2 log n). As a consequence, we build a B-tree in O(n3/2 log2n) time as compared to the O(n5/3 log4/3n) time algorithm of Hirschberg and Larmore for the same problem.
Cite
CITATION STYLE
Aggarwal, A., & Tokuyama, T. (1993). An improved algorithm for the Traveler’s problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 762 LNCS, pp. 476–485). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_279
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
