Pages that link to "Item:Q2464320"
From MaRDI portal
The following pages link to Dynamic programming for minimum Steiner trees (Q2464320):
Displaying 34 items.
- Probability Steiner trees and maximum parsimony in phylogenetic analysis (Q393567) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem (Q1400781) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Faster algorithm for optimum Steiner trees (Q1944205) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (Q2840557) (← links)
- Speeding Up Dynamic Programming with Representative Sets (Q2867093) (← links)
- Dynamic Programming for H-minor-free Graphs (Q2914314) (← links)
- Improved Steiner Tree Algorithms for Bounded Treewidth (Q3111665) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Dynamic Steiner Tree Problem (Q3977293) (← links)
- Faster exact algorithms for steiner trees in planar networks (Q4206584) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- (Q5501297) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Optimization of urban transport; an alternative to checkerboard towns plans (Q6059076) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)
