The following pages link to The steiner problem in graphs (Q5636923):
Displayed 47 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- On the point-to-point connection problem (Q673909) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- Proving phylogenetic trees minimal with l-clustering and set partitioning (Q1144514) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- The point-to-point connection problem - analysis and algorithms (Q1377667) (← links)
- The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- Steiner's problem in double trees (Q1861809) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- The propagation of updates to relational tables in a distributed database system (Q1910779) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← 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)
- A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
- Using structured steiner trees for hierarchical global routing (Q3348418) (← links)
- The number of tree stars is O*(1.357k) (Q3439499) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- Reoptimization of Steiner Trees (Q3512464) (← links)
- Fuzzy Replacement Analysis (Q3536792) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- On finding steiner vertices (Q3787814) (← links)
- (Q3907583) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
- The computation of nearly minimal Steiner trees in graphs (Q4750659) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- A branch-and-price algorithm for switch-box routing (Q4785215) (← links)
- Cost-minimal trees in directed acyclic graphs (Q5181099) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets (Q5505641) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)