Parameterized Complexity of Arc-Weighted Directed Steiner Problems
From MaRDI portal
Publication:5894323
DOI10.1137/100794560zbMath1230.05268OpenAlexW2035613592MaRDI QIDQ5894323
Jiong Guo, Rolf Niedermeier, Ondřej Suchý
Publication date: 27 October 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100794560
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Algorithms in computer science (68W99)
Related Items (10)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ On Directed Steiner Trees with Multiple Roots ⋮ An ETH-tight algorithm for bidirected Steiner connectivity ⋮ Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Complexity of the Steiner Network Problem with Respect to the Number of Terminals ⋮ Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems ⋮ Unnamed Item
This page was built for publication: Parameterized Complexity of Arc-Weighted Directed Steiner Problems
