Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph

The subject of the paper is to show that, by utilizing maximum-weight matching algorithms, we obtain heuristic algorithms of high capability for the k-edge-connectivity augmentation problem of graphs. The following points are shown by experimentally comparing the capabilities of eighteen algorithms for 4,175 graphs G' = (V, E') with 10/spl les/|V|/spl les/1400: (1) an existing algorithm, FSM, (previously proposed by us), based on an algorithm for finding a maximum-weight matching, produces the best solutions, while it becomes unrealistic when |V|>1000; (2) by utilizing a 2-approximation algorithm for the maximum-weight matching problem, a promising algorithm, HBD/sub a+/, is proposed, and it is shown that the second best solution (average 1.017 times that of FSM) is obtained in much shorter CPU time (average 0.1 times that of FSM).

[1]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[2]  Toshimasa Watanabe,et al.  The k-Edge-Connectivity Augmentation Problem of Weighted Graphs , 1992, ISAAC.

[3]  David Avis,et al.  A survey of heuristics for the weighted matching problem , 1983, Networks.

[4]  Samir Khuller,et al.  Biconnectivity approximations and graph carvings , 1992, STOC '92.

[5]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[6]  Harold N. Gabow.  A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.

[7]  Toshimasa Watanabe,et al.  Efficient approximation algorithms for the maximum weight matching problem , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[8]  Samir Khuller,et al.  Approximation Algorithms for Graph Augmentation , 1992, ICALP.

[9]  Samir Khuller,et al.  A uniform framework for approximating weighted connectivity problems , 1999, SODA '99.

[10]  Joseph JáJá,et al.  Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..

[11]  Toshimasa Watanabe,et al.  Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[12]  E. A. Timofeev,et al.  Efficient algorithm for finding all minimal edge cuts of a nonoriented graph , 1986 .

[13]  Robert Preis,et al.  Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[14]  Hiroshi Nagamochi,et al.  Constructing a cactus for minimum cust og a graph in O(mn+n2log n) time and O(m) space , 2003 .

[15]  Shimon Even,et al.  Graph Algorithms , 1979 .

[16]  Akira Nakamura,et al.  Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[17]  A. Nakamura,et al.  3-edge-connectivity augmentation problems , 1989, IEEE International Symposium on Circuits and Systems,.

[18]  Harold N. Gabow,et al.  A representation for crossing set families with applications to submodular flow problems , 1993, SODA '93.

[19]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[20]  Toshimasa Watanabe,et al.  Approximation algorithms for the k-edge-connectivity augmentation problem , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[21]  Harold N. Gabow,et al.  A scaling algorithm for weighted matching on general graphs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).