Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length

Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of vertices can be connected by two vertex-disjoint paths of length ≤ D. We show that this problem and some of its variants are NP-hard, and we present approximation algorithms with worst-case bounds 6 and 4. Topics. Graph algorithms, approximation algorithms.

• Type: Conference
• Year: 2005
• Where: WADS
• Authors: Victor Chepoi, Bertrand Estellon, Yann Vaxès
• Keywords: Algorithms, Approximation Algorithms, Augmented Graph, Positive Integer D, WADS 2005