Approximating k-node connected subgraphs via critical graphs

Keyphrases

• Approximation Ratio 100%
• Connected Subgraphs 100%
• Critical Graph 100%
• Undirected Graph 75%
• Approximation Guarantee 75%
• Directed Graph 50%
• Approximation Algorithms 25%
• Integrality Gap 25%
• LP Relaxation 25%
• Node number 25%
• Minimum Cost 25%
• Connected Spanning Subgraph 25%
• Primal-dual Algorithm 25%
• Large Values 25%
• Graph Theory 25%
• New Approximation 25%

Computer Science

• Directed Graphs 100%
• Connected Subgraph 100%
• Critical Graph 100%
• Approximation Ratio 80%
• Approximation (Algorithm) 60%
• Approximation Algorithms 20%
• Subgraphs 20%
• Primal-Dual 20%
• Graph Theory 20%

Mathematics

• Critical Graph 100%
• Upper Bound 50%