Online Connectivity Augmentation (opens in new tab)

The Connectivity Augmentation Problem (CAP) is a fundamental problem in fault-tolerant network design and has been extensively studied in the context of approximation algorithms. In this work, we consider CAP in the online setting: given a $k$-edge-connected graph $G$ and a set $L$ of additional edges over the vertices of $G$, called links, online requests arrive one by one, each specifying two vertices that need to be $(k+1)$-edge-connected. We...