Pages that link to "Item:Q262265"

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

Displaying 7 items.

• Directed Steiner trees with diffusion costs (Q346492) (← links)
• A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
• A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← 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)