Parameterized algorithms for Steiner forest in bounded width graphs
From MaRDI portal
Cites work
- A primal-dual approximation algorithm for the Steiner forest problem
- An O(n n) approximation scheme for Steiner tree in planar graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dynamic programming for minimum Steiner trees
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Fourier meets M\"{o}bius: fast subset convolution
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- scientific article; zbMATH DE number 7053305 (Why is no real title available?)
- Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces
- On the Computational Complexity of Combinatorial Problems
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Parameterized algorithms
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
- Parameterized max min feedback vertex set
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Steiner tree approximation via iterative randomized rounding
- Steiner tree problems
- Steiner tree problems in telecommunications
- Structural parameterizations for two bounded degree problems revisited
- The design of approximation algorithms
- The Steiner forest problem revisited
- The steiner problem in graphs
- The Steiner tree problem on graphs: inapproximability results
Cited in
(2)
This page was built for publication: Parameterized algorithms for Steiner forest in bounded width graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875139)
