Dynamic programming for minimum Steiner trees
From MaRDI portal
Publication:2464320
Recommendations
Cited in
(46)- Vertex and edge covers with clustering properties: Complexity and algorithms
- Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Faster algorithm for optimum Steiner trees
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Minimum diameter vertex-weighted Steiner tree
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Computing optimal Steiner trees in polynomial space
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Sharp separation and applications to exact and parameterized algorithms
- The number of tree stars is \(O^{*}(1.357^k)\)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
- Parameterized study of Steiner tree on unit disk graphs
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
- Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Dynamic Programming for H-minor-free Graphs
- Improved Steiner tree algorithms for bounded treewidth
- On directed Steiner trees with multiple roots
- Parameterized single-exponential time polynomial space algorithm for Steiner tree
- Faster Steiner Tree Computation in Polynomial-Space
- Approaches to the Steiner Problem in Networks
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Probability Steiner trees and maximum parsimony in phylogenetic analysis
- Dynamic Steiner Tree Problem
- Faster exact algorithms for steiner trees in planar networks
- Parameterized single-exponential time polynomial space algorithm for Steiner tree
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- Listing induced Steiner subgraphs as a compact way to discover Steiner trees in graphs
- Parameterized complexity of directed Steiner tree on sparse graphs
- A Faster Algorithm for the Steiner Tree Problem
- scientific article; zbMATH DE number 6469181 (Why is no real title available?)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
- Optimization of urban transport; an alternative to checkerboard towns plans
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- Solving Steiner trees: Recent advances, challenges, and perspectives
- An ETH-tight algorithm for bidirected Steiner connectivity
- The parameterized complexity of the survivable network design problem
- Parameterized algorithms for the Steiner arborescence problem on a hypercube
- Parameterized algorithms for Steiner forest in bounded width graphs
- Parameterized algorithms for \textsc{Steiner Forest} in bounded width graphs
- Polynomial formulations as a barrier for reduction-based hardness proofs
- The complexity landscape of fixed-parameter directed Steiner network problems
- Steiner tree parameterized by multiway cut and even less
- Parameterized algorithms for node connectivity augmentation problems
This page was built for publication: Dynamic programming for minimum Steiner trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464320)
