IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v30y1982i5p1009-1013.html
   My bibliography  Save this article

Technical Note—Reducing Space Requirements for Shortest Path Problems

Author

Listed:
  • J. Ian Munro

    (University of Waterloo, Waterloo, Ontario, Canada)

  • Raul J. Ramirez

    (University of Waterloo, Waterloo, Ontario, Canada)

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.

Suggested Citation

  • J. Ian Munro & Raul J. Ramirez, 1982. "Technical Note—Reducing Space Requirements for Shortest Path Problems," Operations Research, INFORMS, vol. 30(5), pages 1009-1013, October.
    • Handle: RePEc:inm:oropre:v:30:y:1982:i:5:p:1009-1013
    DOI: 10.1287/opre.30.5.1009
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.5.1009
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.30.5.1009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:30:y:1982:i:5:p:1009-1013. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.