A Faster Algorithm for the Steiner Tree Problem
From MaRDI portal
Recommendations
Cited in
(25)- 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
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
- Computing optimal Steiner trees in polynomial space
- Dynamic programming for minimum Steiner trees
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
- Improved Steiner tree algorithms for bounded treewidth
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- Faster Steiner Tree Computation in Polynomial-Space
- A fast algorithm for computing steiner edge connectivity
- Exponential approximation schemata for some network design problems
- scientific article; zbMATH DE number 169458 (Why is no real title available?)
- Faster exact algorithms for steiner trees in planar networks
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- Definition and algorithms for reliable Steiner tree problem
- Parameterized approximation algorithms for bidirected Steiner network problems
- On the Hardness of Reoptimization
- Splitting trees at vertices
- Reoptimization of Steiner trees: changing the terminal set
- A factoring approach for the Steiner tree problem in undirected networks
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Solving connected dominating set faster than \(2^n\)
This page was built for publication: A Faster Algorithm for the Steiner Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449830)
