A (1 + ln 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

Keyphrases

• Approximation Algorithms 100%
• 2-approximation 100%
• 2-edge-connected 100%
• Connectivity Augmentation 100%
• Tree Augmentation 100%
• Minimum Cost 100%
• Constant Radius 100%
• Network Design Problem 33%
• Approximation Ratio 33%
• Disjoint 33%
• Edge Cover 33%
• Family of Sets 33%
• Network Design 33%
• Laminar Family 33%
• Family Play 33%
• Augmentation Problems 33%

Mathematics

• Edge 100%
• Edge-Connectivity 100%
• Open Problem 33%
• Edge Cover 33%
• Problem Solution 33%