An improved algorithm for the Traveler’s problem

Alok Aggarwal, Takeshi Tokuyama

研究成果: Conference 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.

本文言語English
ホスト出版物のタイトルAlgorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings
編集者Francis Y.L. Chin, Prabhakar Raghavan, N.V. Balasubramanian, Kam Wing Ng
出版社Springer-Verlag
ページ476-485
ページ数10
ISBN(印刷版)9783540575689
出版ステータスPublished - 1993 1 1
イベント4th International Symposium on Algorithms and Computation, ISAAC 1993 - Hong Kong, China
継続期間: 1993 12 151993 12 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
762 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other4th International Symposium on Algorithms and Computation, ISAAC 1993
国/地域China
CityHong Kong
Period93/12/1593/12/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「An improved algorithm for the Traveler’s problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル