An improved algorithm for the traveler’s problem

Alok Aggarwal; Takeshi Tokuyama

doi:10.1006/jagm.1995.1039

An improved algorithm for the traveler’s problem

Alok Aggarwal, Takeshi Tokuyama

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

In a paper in Journal of Algorithms13 (1992), 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 log^1/3n) time algorithm for solving the 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 log²n) time as compared to the O(n^5/3 log^4/3n) time algorithm of Hirschberg and Larmore.

Original language	English
Pages (from-to)	318-330
Number of pages	13
Journal	Journal of Algorithms
Volume	19
Issue number	2
DOIs	https://doi.org/10.1006/jagm.1995.1039
Publication status	Published - 1995 Sep

ASJC Scopus subject areas

Control and Optimization
Computational Mathematics
Computational Theory and Mathematics

Access to Document

10.1006/jagm.1995.1039

Cite this

@article{9f31385d4f3442da8aff5883043d8a93,

title = "An improved algorithm for the traveler{\textquoteright}s problem",

abstract = "In a paper in Journal of Algorithms13 (1992), 148-160, Hirschberg and Larmore introduced the traveler{\textquoteright}s problem as a subroutine for constructing the B-tree. They gave an O(n5/3 log1/3n) time algorithm for solving the traveler{\textquoteright}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.",

author = "Alok Aggarwal and Takeshi Tokuyama",

year = "1995",

month = sep,

doi = "10.1006/jagm.1995.1039",

language = "English",

volume = "19",

pages = "318--330",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - An improved algorithm for the traveler’s problem

AU - Aggarwal, Alok

AU - Tokuyama, Takeshi

PY - 1995/9

Y1 - 1995/9

N2 - In a paper in Journal of Algorithms13 (1992), 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 the 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.

AB - In a paper in Journal of Algorithms13 (1992), 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 the 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.

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

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

U2 - 10.1006/jagm.1995.1039

DO - 10.1006/jagm.1995.1039

M3 - Article

AN - SCOPUS:58149209969

VL - 19

SP - 318

EP - 330

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -

An improved algorithm for the traveler’s problem

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this