Title :
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph
Author :
Watanabe, Toshimasa ; Taoka, Satoshi ; Mashima, Toshiya
Author_Institution :
Dept. of Circuits & Syst., Hiroshima Univ., Japan
Abstract :
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
Keywords :
approximation theory; computational complexity; graph theory; approximation algorithms; edge costs; multiple edges; specified vertices; three-edge-connectivity augmentation; unweighted version; weighted version; Approximation algorithms; Circuits; Cost function; Joining processes; Sliding mode control;
Conference_Titel :
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-1281-3
DOI :
10.1109/ISCAS.1993.394225
