Neogi, Rian (University of Waterloo, 2021-09-03)
In this thesis, we study approximation algorithms for Connectivity Augmentation and related problems.
In the Connectivity Augmentation problem, one is given a base graph G=(V,E) that is k-edge-connected, and an additional ...