A note on Rooted Survivable Networks

Keyphrases

• Survivable Network Design Problem 100%
• Survivable Networks 100%
• Approximation Algorithms 33%
• Disjoint 33%
• Node Connectivity 33%
• Vertex Connectivity 33%
• Minimum Cost 33%
• Inapproximability 33%
• Primal-dual Algorithm 33%
• Complete Graph 33%
• Large Values 33%
• Directed Steiner Tree 33%
• MaxT 33%
• Node Set 33%

Computer Science

• Network Design 100%
• Approximation Algorithms 50%
• Vertex Connectivity 50%
• Connectivity Node 50%
• Network Design Problem 50%
• Subgraphs 50%
• steiner tree 50%
• Primal-Dual 50%

Mathematics

• Edge 100%
• Approximates 100%
• Complete Graph 100%