Pages that link to "Item:Q6058195"
From MaRDI portal
The following pages link to Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195):
Displaying 5 items.
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs (Q5369505) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)