Improved Steiner tree algorithms for bounded treewidth
From MaRDI portal
Recommendations
- Improved Steiner tree algorithms for bounded treewidth
- An improved algorithm for the Steiner tree problem with bounded edge-length
- An Improved Algorithm for Steiner Trees
- Improved Approximations for the Steiner Tree Problem
- scientific article; zbMATH DE number 742979
- scientific article; zbMATH DE number 1445376
- An improved LP-based approximation for Steiner tree
- scientific article; zbMATH DE number 2073988
- Tighter Bounds for Graph Steiner Tree Approximation
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- An O(n n) approximation scheme for Steiner tree in planar graphs
- Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
- Complexity of Finding Embeddings in a k-Tree
- Fourier meets M\"{o}bius: fast subset convolution
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 6381762 (Why is no real title available?)
- scientific article; zbMATH DE number 1003287 (Why is no real title available?)
- scientific article; zbMATH DE number 3815666 (Why is no real title available?)
- scientific article; zbMATH DE number 3679828 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 6783450 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved bounds on Bell numbers and on moments of sums of random variables
- Linear-time computation of optimal subgraphs of decomposable graphs
- Polynomially solvable special cases of the Steiner problem in planar networks
- Practical Partitioning-Based Methods for the Steiner Problem
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Steiner trees, partial 2–trees, and minimum IFI networks
- The Rectilinear Steiner Tree Problem is NP-Complete
- The Steiner forest problem revisited
- The steiner problem in graphs
- The Steiner problem with edge lengths 1 and 2
- Treewidth. Computations and approximations
- Treewidth: Structure and Algorithms
Cited in
(17)- Computing directed Steiner path covers
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Steiner trees for hereditary graph classes: a treewidth perspective
- scientific article; zbMATH DE number 6381651 (Why is no real title available?)
- Algorithms for the maximum weight connected k-induced subgraph problem
- Improved Steiner tree algorithms for bounded treewidth
- Strong Steiner tree approximations in practice
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
- On Hop-Constrained Steiner Trees in Tree-Like Metrics
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- Solving Steiner trees: Recent advances, challenges, and perspectives
- P versus NPC: minimum Steiner trees in convex split graphs
- On convexity in split graphs: complexity of Steiner tree and domination
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
- Tight double exponential lower bounds
- Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
This page was built for publication: Improved Steiner tree algorithms for bounded treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932355)
