Edge-Connectivity Augmentation and Network Matrices
暂无分享,去创建一个
[1] Joseph Naor,et al. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality , 1993, Math. Program..
[2] András Frank. Augmenting Graphs to Meet Edge-Connectivity Requirements , 1992, SIAM J. Discret. Math..
[3] Guido Proietti,et al. Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems , 2003, Algorithmica.
[4] Harold N. Gabow,et al. Applications of a poset representation to edge connectivity and graph rigidity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[5] Hiroshi Nagamochi,et al. An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree , 1999, Discret. Appl. Math..
[6] Akira Nakamura,et al. Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..
[7] S. Khuller. Approximation algorithms for finding highly connected subgraphs , 1996 .
[8] D. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .
[9] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[10] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[11] S. Khuller,et al. Approximation Algorithms for Graph Augmentation , 1992, J. Algorithms.
[12] Jon Feldman,et al. A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set , 2001, RANDOM-APPROX.
[13] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..