Pages that link to "Item:Q5449830"
From MaRDI portal
The following pages link to A Faster Algorithm for the Steiner Tree Problem (Q5449830):
Displayed 15 items.
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- Splitting trees at vertices (Q616363) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (Q2840557) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)