Pages that link to "Item:Q262265"

The following pages link to Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265):

Displaying 3 items.

• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)