Iterative rounding approximation algorithms for degree-bounded node-connectivity network design

Keyphrases

• K-connected 100%
• Approximation Algorithms 100%
• Node Connectivity 100%
• Network Design 100%
• Network Connectivity 100%
• Iterative Rounding 100%
• Degree Bounds 66%
• Undirected Graph 33%
• 2-approximation 33%
• Approximation Ratio 33%
• Connection Problem 33%
• Directed Graph 33%
• Biset 33%
• Linear Programming Relaxation 33%
• Rounding Algorithm 33%
• K-subsets 33%

Computer Science

• Approximation Algorithms 100%
• Connectivity Node 100%
• Approximation (Algorithm) 100%
• Network Design 100%
• Directed Graphs 50%
• Approximation Ratio 25%
• Connectivity Problem 25%
• Subgraphs 25%
• Rounding Algorithm 25%
• Linear Programming 25%