Pages that link to "Item:Q4598214"
From MaRDI portal
The following pages link to Approximating Directed Steiner Problems via Tree Embedding (Q4598214):
Displaying 3 items.
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← 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)
