Pages that link to "Item:Q3183443"
From MaRDI portal
The following pages link to 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 (Q3183443):
Displaying 6 items.
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)