The following pages link to Thek-Steiner Ratio in Graphs (Q4337667):
Displaying 29 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- The full Steiner tree problem (Q702772) (← links)
- Performance evaluation for energy efficient topologic control in ad hoc wireless networks (Q703562) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← 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)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree (Q3511368) (← links)
- T-joins in strongly connected hypergraphs (Q4597952) (← links)
- (Q5002685) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- On the lossy kernelization for connected treedepth deletion set (Q6043184) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)