A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
1999
Mathematical programming
In the edge connectivity augmentation problem one wants to find an edge set of minimum total capacity that increases the edge connectivity of a given undirected graph by τ. It is a known non-trivial property of the edge connectivity augmentation problem that there is a sequence of edge sets E 1 , E 2 , . . . , such that i≤τ E i optmially increases the connectivity by τ, for any integer τ. The main result of the paper is that this sequence of edge sets can be divided into O(n) groups such that
doi:10.1007/s101070050042
fatcat:aqig3b3eubffrf5eensolxjrxa