Skip to main content
SpringerLink
Log in

An improved algorithm for the traveler's problem

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Included in the following conference series:

  • 166 Accesses

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(n 5/3 log1/3 n) time algorithm for solving traveler's problem of size n. In this paper, we improve their time bound to O(n 3/2 log n). As a consequence, we build a B-tree in O(n 3/2 log2 n) time as compared to the O(n 5/3 log4/3 n) time algorithm of Hirschberg and Larmore for the same problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilbur, Geometric Applications of a Matrix-Searching Algorithm, Algorithmica 2 (1987), 209–233.

    Article  Google Scholar 

  2. A. Aggarwal, J. Chang and C. Yap, Minimum Area Circumscribing Polygons, The Visual Computer 1 (1985), 112–117.

    Article  Google Scholar 

  3. A. Aggarwal and J. Park, Notes on Searching in Multidimensional Monotone Arrays, Proc. of the 29th Annual IEEE Symposium on the Foundations of Computing (1988), 497–512.

    Google Scholar 

  4. A. Aggarwal, B. Schieber, and T. Tokuyama, Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications, Proc. of The 9-th ACM Symp. on Computational Geometry, (1993), 189–197.

    Google Scholar 

  5. J. Boyce, D. Dobkin, R. Drysdale, and L. Guibas, Finding Extremal Polygons, SIAM J. on Computing 14 (1985), 134–147.

    Article  Google Scholar 

  6. D. Hirschberg and L. Larmore, The Traveler's Problem, J. of Algorithms 13 (1992), 148–160.

    Article  Google Scholar 

  7. L. Larmore and B. Schieber, On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure, J. of Algorithms 12 (1991), 490–515.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, T. J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY

    Alok Aggarwal

  2. IBM Research Division, Tokyo Research Laboratory, 1623-14, Shimotsuruma, Yamato-shi, 242, Kanagawa, Japan

    Takeshi Tokuyama

Authors
  1. Alok Aggarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takeshi Tokuyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aggarwal, A., Tokuyama, T. (1993). An improved algorithm for the traveler's problem. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_279

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_279

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation