IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v48y2024i3d10.1007_s10878-024-01213-y.html
   My bibliography  Save this article

Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges

Author

Listed:
  • Yuya Higashikawa

    (University of Hyogo)

  • Naoki Katoh

    (University of Hyogo)

  • Junichi Teruyama

    (University of Hyogo)

  • Yuki Tokuni

    (University of Hyogo)

Abstract

In this paper, we propose new algorithms for evacuation problems defined on dynamic flow networks. A dynamic flow network is a directed graph in which source nodes are given supplies and a single sink node is given a demand. The evacuation problem seeks a dynamic flow that sends all supplies from sources to the sink such that its demand is satisfied in the minimum feasible time horizon. For this problem, the current best algorithms are developed by Schlöter (2018) and Kamiyama (2019), which run in strongly polynomial time but with high-order polynomial time complexity because they use submodular function minimization as a subroutine. In this paper, we propose new algorithms that do not explicitly execute submodular function minimization, and we prove that they are faster than the current best algorithms when an input network is restricted such that the sink has a small in-degree and every edge has the same capacity.

Suggested Citation

  • Yuya Higashikawa & Naoki Katoh & Junichi Teruyama & Yuki Tokuni, 2024. "Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges," Journal of Combinatorial Optimization, Springer, vol. 48(3), pages 1-22, October.
    • Handle: RePEc:spr:jcomop:v:48:y:2024:i:3:d:10.1007_s10878-024-01213-y
    DOI: 10.1007/s10878-024-01213-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01213-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01213-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:48:y:2024:i:3:d:10.1007_s10878-024-01213-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.