The following pages link to (Q4252319):
Displaying 29 items.
- On the approximability of dense Steiner problems (Q396661) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- (Q3137223) (← links)
- A Dual-Radix Approach to Steiner’s 1-Cycle Theorem (Q3296102) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- (Q4027204) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)
- An exact branch and bound algorithm for the Steiner Problem in Graphs (Q6085757) (← links)
- Approximations for the Steiner multicycle problem (Q6109004) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)
- Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)