Exact solutions for the Steiner path cover problem on special graph classes

DOI10.1007/978-3-030-48439-2_40MaRDI QIDQ2050271zbMATH OpenOpenAlexFDO

Authors Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke

Publication date 30 August 2021

Full work available at URL https://doi.org/10.1007/978-3-030-48439-2_40

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• The Steiner cycle and path cover problem on interval graphs
• An exact branch and bound algorithm for the Steiner Problem in Graphs
• scientific article; zbMATH DE number 1305548
• scientific article; zbMATH DE number 1445321
• Approximation algorithms for the covering Steiner problem
• scientific article; zbMATH DE number 4128830
• Polynomially solvable special cases of the Steiner problem in planar networks
• On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
• On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
• On exact solutions to the Euclidean bottleneck Steiner tree problem

Cited in

(3)

• Computing directed Steiner path covers
• Computing directed Steiner path covers for directed co-graphs (extended abstract)
• The Steiner cycle and path cover problem on interval graphs

This page was built for publication: Exact solutions for the Steiner path cover problem on special graph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2050271)