A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Keyphrases

• 2-edge-connected 100%
• Approximation Algorithms 100%
• Connected Graph 100%
• Disjoint 100%
• Edge-connectivity 100%
• Graph Connectivity 100%
• Minimum Size 100%
• NP-hard Problem 100%

Mathematics

• Connected Graph 50%
• Edge 100%
• Edge-Connectivity 100%
• NP-hard Problem 50%
• Subset Size 50%