TY - GEN

T1 - An improved algorithm for the Traveler’s problem

AU - Aggarwal, Alok

AU - Tokuyama, Takeshi

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85029639162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029639162&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85029639162

SN - 9783540575689

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 476

EP - 485

BT - Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings

A2 - Chin, Francis Y.L.

A2 - Raghavan, Prabhakar

A2 - Balasubramanian, N.V.

A2 - Ng, Kam Wing

PB - Springer-Verlag

T2 - 4th International Symposium on Algorithms and Computation, ISAAC 1993

Y2 - 15 December 1993 through 17 December 1993

ER -