Technical Note—Reducing Space Requirements for Shortest Path Problems

J. Ian Munro and Raul J. Ramirez
Additional contact information
J. Ian Munro: University of Waterloo, Waterloo, Ontario, Canada
Raul J. Ramirez: University of Waterloo, Waterloo, Ontario, Canada

Operations Research, 1982, vol. 30, issue 5, 1009-1013

Abstract: The problem of determining the shortest path through a level network using as little space as possible is considered. Let k denote the number of levels and assume each level contains m nodes. A space efficient technique is presented by which the shortest route from a source to a sink may be found in a complete level graph using θ( m + k ) storage locations and a factor of only θ(log k ) more basic operations than space inefficient methods. If an edge from node p of level i to node q of level i + 1 exists only if p ≥ q , then the space saving technique may also be employed. In this case the run time of the algorithm is at most twice that of conventional approaches.

Keywords: 112 dynamic programming applications; 321 information systems management (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.5.1009 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:30:y:1982:i:5:p:1009-1013

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().