Approximation Algorithms for Several Graph Augmentation Problems
暂无分享,去创建一个
Graph augmentation problems on a weighted graph involve determining a minimum-cost set of edges to add to a graph to satisfy a specified property, such as biconnectivity, bridge-connectivity or strong connectivity. These augmentation problems are shown to be NP-complete in the restricted case of the graph being initially connected. Approximation algorithms with favorable time complexity are presented and shown to have constant worst-case performance ratios.
[1] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..
[2] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.