Pages that link to "Item:Q344954"
From MaRDI portal
The following pages link to On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954):
Displaying 5 items.
- The last dozen of years of or research in Czechia and Slovakia (Q2673270) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← 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)