Exact solutions for the Steiner path cover problem on special graph classes
type: Item
instance of: scholarly article
title: Exact solutions for the Steiner path cover problem on special graph classes
zbMATH Open document ID: 1471.90047
DOI: 10.1007/978-3-030-48439-2_40
author: Frank Gurski
author: Stefan Hoffmann
author: Dominique Komander
author: Carolin Rehs
author: Jochen Rethmann
author: Egon Wanke
publication date: 2021-08-30T00:00:00Z
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 7388233
MaRDI profile type: Publication
full work available at URL: 978-3-030-48439-2 40
OpenAlex ID: W3087770235
Recommended article: The Steiner cycle and path cover problem on interval graphs
Recommended article: An exact branch and bound algorithm for the Steiner Problem in Graphs
Recommended article: Q4252440
Recommended article: Q4952636
Recommended article: Approximation algorithms for the covering Steiner problem
Recommended article: Q4207918
Recommended article: Polynomially solvable special cases of the Steiner problem in planar networks
Recommended article: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
Recommended article: On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
Recommended article: On exact solutions to the Euclidean bottleneck Steiner tree problem
description: scientific article; zbMATH DE number 7388233