The following pages link to (Q5692514):
Displaying 16 items.
- A degree based approach to find Steiner trees (Q327685) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- Exploring the constrained maximum edge-weight connected graph problem (Q1048254) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- The minimum size of a graph with given tree connectivity (Q2227103) (← links)
- On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)