IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i1d10.1007_s10878-021-00757-7.html
   My bibliography  Save this article

The Steiner cycle and path cover problem on interval graphs

Author

Listed:
  • Ante Ćustić

    (Simon Fraser University Surrey)

  • Stefan Lendl

    (Graz University of Technology
    University of Graz)

Abstract

The Steiner path problem is a common generalization of the Steiner tree and the Hamiltonian path problem, in which we have to decide if for a given graph there exists a path visiting a fixed set of terminals. In the Steiner cycle problem we look for a cycle visiting all terminals instead of a path. The Steiner path cover problem is an optimization variant of the Steiner path problem generalizing the path cover problem, in which one has to cover all terminals with a minimum number of paths. We study those problems for the special class of interval graphs. We present linear time algorithms for both the Steiner path cover problem and the Steiner cycle problem on interval graphs given as endpoint sorted lists. The main contribution is a lemma showing that backward steps to non-Steiner intervals are never necessary. Furthermore, we show how to integrate this modification to the deferred-query technique of Chang et al. to obtain the linear running times.

Suggested Citation

  • Ante Ćustić & Stefan Lendl, 2022. "The Steiner cycle and path cover problem on interval graphs," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 226-234, January.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:1:d:10.1007_s10878-021-00757-7
    DOI: 10.1007/s10878-021-00757-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00757-7
    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-021-00757-7?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.

    References listed on IDEAS

    as
    1. Frank Gurski & Stefan Hoffmann & Dominique Komander & Carolin Rehs & Jochen Rethmann & Egon Wanke, 2020. "Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 331-338, Springer.
    2. Salazar-Gonzalez, Juan-Jose, 2003. "The Steiner cycle polytope," European Journal of Operational Research, Elsevier, vol. 147(3), pages 671-679, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frank Gurski & Dominique Komander & Carolin Rehs & Jochen Rethmann & Egon Wanke, 2022. "Computing directed Steiner path covers," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 402-431, March.

    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:43:y:2022:i:1:d:10.1007_s10878-021-00757-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.