The following pages link to (Q4252355):
Displaying 15 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Some results on spanning trees (Q601948) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic (Q1007642) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← 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)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
