Pages that link to "Item:Q4962166"
From MaRDI portal
The following pages link to Approximating Rooted Steiner Networks (Q4962166):
Displaying 10 items.
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Analysis of Steiner subtrees of random trees for traceroute algorithms (Q3055772) (← links)
- (Q5743494) (← 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)
- Improved approximations for relative survivable network design (Q6574948) (← links)
