Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph
Takahiro Watanabe, Satoshi Taoka, Toshiya Mashima · 1993 IEEE International Symposium on Circuits and Systems · 2002
The 3-edge-connectivity augmentation problem for a specified set of vertices, where the graph can have multiple edges, is addressed. Both the weighted version, in which there may exist some distinct edge costs, and the unweighted version are treated. Approximation algorithms are given.>