Pages that link to "Item:Q4977990"

The following pages link to Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree (Q4977990):

Displayed 5 items.

• Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) ‎ (← 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)