Pages that link to "Item:Q2942396"
From MaRDI portal
The following pages link to A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396):
Displaying 5 items.
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Subjectively interesting connecting trees and forests (Q2218354) (← links)
- Linear Programming Hierarchies Suffice for Directed Steiner Tree (Q5419003) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)