The following pages link to The steiner problem in graphs (Q5636923):
Displaying 50 items.
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- On the point-to-point connection problem (Q673909) (← links)
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- On the terminal connection problem (Q831820) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← 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)
- Finding induced trees (Q967418) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Multiple hypernode hitting sets and smallest two-cores with targets (Q1041434) (← 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)
- Greedy can beat pure dynamic programming (Q1628699) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Parameterized complexity of team formation in social networks (Q1704854) (← links)
- A dynamic programming approach for the pipe network layout problem (Q1735166) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← 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)
