An improved algorithm for the Traveler’s problem

Alok Aggarwal, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings
EditorsKam Wing Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540575689
Publication statusPublished - 1993
Externally publishedYes
Event4th International Symposium on Algorithms and Computation, ISAAC 1993 - Hong Kong, China
Duration: 1993 Dec 151993 Dec 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume762 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other4th International Symposium on Algorithms and Computation, ISAAC 1993
CityHong Kong

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'An improved algorithm for the Traveler’s problem'. Together they form a unique fingerprint.

Cite this