Special Edges, and Approximating the Smallest Directed k-Edge Connected Spanning Subgraph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 227-236

  Gabow, Harold N ^a  

^a University of Colorado at Boulder   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; COMPUTER SCIENCE; GRAPH THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; CYCLE CONTRACTION ALGORITHMS;

EDGE DETECTION;

EID: 1842435931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. C. Berge, Graphs, 2nd Revised Ed., North-Holland, NY, 1985.
2. M. Cai, The number of vertices of degree k in a minimally k-edge-connected graph, J. Comb. Theory B, 58 (1993), pp.225-239.
3. J. Cheriyan and R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J. Comput., 30, 2 (2000), pp.528-560.
4. A. Frank, Submodular functions in graph theory, Discrete Math., 111 (1993), pp.231-243.
5. H.N. Gabow, Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph, Proc. 14th Annual ACM-SIAM Symp. on Disc. Algorithms, 2003, pp.460-469.
6. H.N. Gabow, On the difficulty of k-connected spanning subgraph problems, unpublished notes.
7. S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Appoximation Algorithms for NP-hard Problems, D.S. Hochbaum, Ed., PWS Publishing, Boston, MA, 1997.
8. S. Khuller, B. Raghavachari and N. Young, Approximating the minimum equivalent digraph, SIAM J. Comput., 24, 4 (1995), pp.859-872.
9. S. Khuller, B. Raghavachari and N. Young, On strongly connected digraphs with bounded cycle length, Disc. Applied Math., 69 (1996), pp.281-289.
10. P. Tong and E.L. Lawler, A faster algorithm for finding edge-disjoint branchings, Inf. Proc. Letters 17, 2 (1983), pp.73-76.
11. A. Vetta, Approximating the minimum strongly connected subgraph via a matching lower bound, Proc. 12th Annual ACM-SIAM Symp. on Disc. Algorithms, 2001, pp.417-426.