A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow
European Symposium on Algorithms
Given an edge weighted graph and a forest F, the 2-edge connectivity augmentation problem is to pick a minimum weighted set of edges, E', such that every connected component of E' ∪ F is 2-edge connected. Williamson et al. gave a 2-approximation algorithm (WGMV) for this problem using the primal-dual schema. We show that when edge weights are integral, the WGMV procedure can be modified to obtain a half-integral dual. The 2-edge connectivity augmentation problem has an interesting connection todoi:10.4230/lipics.esa.2020.55 dblp:conf/esa/GargK20 fatcat:fukv475af5f7ln3gejcwo425pa