Pages that link to "Item:Q647390"
From MaRDI portal
The following pages link to New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390):
Displaying 4 items.
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- On the Price of Stability of Undirected Multicast Games (Q2959842) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
