Algorithms for the quickest path problem and the enumeration of quickest paths

J. B. Rosen, S. Z. Sun, Guoliang Xue

Research output: Contribution to journalArticle

96 Citations (Scopus)

Abstract

Let N = (V, A, c, l) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function l. Let σ be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair quickest path problem with time complexity O(re + rn log n), where n = |V|, e = |A|, and r is the number of distinct capacity values of N. In this paper, we first develop an alternative algorithm for the single pair quickest path problem with same time complexity and less space requirement. We then study the constrained quickest path problem and propose an O(re + rn log n) time algorithm. Finally, we develop an algorithm to enumerate the first m quickest paths to send a given amount of data from one node to another with time complexity O(rmne + rmn2 log n).

Original languageEnglish (US)
Pages (from-to)579-584
Number of pages6
JournalComputers and Operations Research
Volume18
Issue number6
DOIs
StatePublished - 1991
Externally publishedYes

Fingerprint

Enumeration
Path
Time Complexity
Arc of a curve
Weight Function
Vertex of a graph
time
Routing
Non-negative
Distinct
Alternatives
Requirements
Values
Node

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Algorithms for the quickest path problem and the enumeration of quickest paths. / Rosen, J. B.; Sun, S. Z.; Xue, Guoliang.

In: Computers and Operations Research, Vol. 18, No. 6, 1991, p. 579-584.

Research output: Contribution to journalArticle

@article{5c9979d017e0435cb565458ef1df90a4,
title = "Algorithms for the quickest path problem and the enumeration of quickest paths",
abstract = "Let N = (V, A, c, l) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function l. Let σ be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair quickest path problem with time complexity O(re + rn log n), where n = |V|, e = |A|, and r is the number of distinct capacity values of N. In this paper, we first develop an alternative algorithm for the single pair quickest path problem with same time complexity and less space requirement. We then study the constrained quickest path problem and propose an O(re + rn log n) time algorithm. Finally, we develop an algorithm to enumerate the first m quickest paths to send a given amount of data from one node to another with time complexity O(rmne + rmn2 log n).",
author = "Rosen, {J. B.} and Sun, {S. Z.} and Guoliang Xue",
year = "1991",
doi = "10.1016/0305-0548(91)90063-W",
language = "English (US)",
volume = "18",
pages = "579--584",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "6",

}

TY - JOUR

T1 - Algorithms for the quickest path problem and the enumeration of quickest paths

AU - Rosen, J. B.

AU - Sun, S. Z.

AU - Xue, Guoliang

PY - 1991

Y1 - 1991

N2 - Let N = (V, A, c, l) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function l. Let σ be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair quickest path problem with time complexity O(re + rn log n), where n = |V|, e = |A|, and r is the number of distinct capacity values of N. In this paper, we first develop an alternative algorithm for the single pair quickest path problem with same time complexity and less space requirement. We then study the constrained quickest path problem and propose an O(re + rn log n) time algorithm. Finally, we develop an algorithm to enumerate the first m quickest paths to send a given amount of data from one node to another with time complexity O(rmne + rmn2 log n).

AB - Let N = (V, A, c, l) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function l. Let σ be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair quickest path problem with time complexity O(re + rn log n), where n = |V|, e = |A|, and r is the number of distinct capacity values of N. In this paper, we first develop an alternative algorithm for the single pair quickest path problem with same time complexity and less space requirement. We then study the constrained quickest path problem and propose an O(re + rn log n) time algorithm. Finally, we develop an algorithm to enumerate the first m quickest paths to send a given amount of data from one node to another with time complexity O(rmne + rmn2 log n).

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

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

U2 - 10.1016/0305-0548(91)90063-W

DO - 10.1016/0305-0548(91)90063-W

M3 - Article

AN - SCOPUS:0025862824

VL - 18

SP - 579

EP - 584

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 6

ER -