Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems

Let (, ) denote the maximum number of pairwise internally disjoint -paths in a graph = (, ). For a set of terminals, is --connected if (, ) ≥ for all , ∈ ; if = then is -connected. Given a root node , is - (, )-connected if (, ) ≥ for all ∈ . We consider the corresponding min-cost connectivity augmentation problems, where we...More