Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes

Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann () and Egon Wanke
Additional contact information
Frank Gurski: Institute of Computer Science
Stefan Hoffmann: Institute of Computer Science
Dominique Komander: Institute of Computer Science
Carolin Rehs: Institute of Computer Science
Jochen Rethmann: Faculty of Electrical Engineering and Computer Science
Egon Wanke: Institute of Computer Science

A chapter in Operations Research Proceedings 2019, 2020, pp 331-338 from Springer

Abstract: Abstract The Steiner path problem is a restriction of the well known Steiner tree problem such that the required terminal vertices lie on a path of minimum cost. While a Steiner tree always exists within connected graphs, it is not always possible to find a Steiner path. Despite this, one can ask for the Steiner path cover, i.e. a set of vertex disjoint simple paths which contains all terminal vertices and possibly some of the non-terminal vertices. We show how a Steiner path cover of minimum cardinality for the disjoint union and join composition of two graphs can be computed in linear time from the corresponding values of the involved graphs. The cost of an optimal Steiner path cover is the minimum number of Steiner vertices in a Steiner path cover of minimum cardinality. We compute recursively in linear time the cost within a Steiner path cover for the disjoint union and join composition of two graphs by the costs of the involved graphs. This leads us to a linear time computation of an optimal Steiner path, if it exists, for special co-graphs.

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-030-48439-2_40

Ordering information: This item can be ordered from
http://www.springer.com/9783030484392

DOI: 10.1007/978-3-030-48439-2_40

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().