A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

Keyphrases

• Connected Graph 100%
• Approximation Algorithms 100%
• 2-approximation 100%
• Connected Spanning Subgraph 100%
• Approximation Ratio 50%
• V(V) 50%
• Polynomial-time Algorithm 50%
• Minimum Weight 50%
• NP-hard 50%
• Connected Subgraphs 50%
• Internally Vertex-disjoint Paths 50%
• Original Problem 50%
• Algorithm Complexity 50%

Mathematics

• Connected Graph 100%
• Polynomial Time 50%