Pages that link to "Item:Q535014"
From MaRDI portal
The following pages link to A partition-based relaxation for Steiner trees (Q535014):
Displaying 15 items.
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic (Q1007642) (← links)
- Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- An improved LP-based approximation for Steiner tree (Q2875185) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q2969617) (← links)
- (Q4252355) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← 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)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
