Approximating the minimum strongly connected subgraph via a matching lower bound

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 417-426

  Vetta, Adrian ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Performance; Theory; Verification

Indexed keywords

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

References (5)

1. Harry T. Hsu, An Algorithm for Finding a Minimal Equivalent Graph of a Digraph, Journal of the ACM (JACM), v.22 n.1, p.11-16, Jan. 1975 [doi〉10.1145/321864.321866]
2. Samir Khuller, Balaji Raghavachari, Neal Young, Approximating the Minimum Equivalent Digraph, SIAM Journal on Computing, v.24 n.4, p.859-872, Aug. 1995 [doi〉10.1137/S0097539793256685]
3. Samir Khuller, Balaji Raghavachari, Neal Young, On strongly connected digraphs with bounded cycle length, Discrete Applied Mathematics, v.69 n.3, p.281-289, Aug. 27, 1996 [doi〉10.1016/0166-218X(95)00105-Z]
4. Dennis M. Moyles, Gerald L. Thompson, An Algorithm for Finding a Minimum Equivalent Graph of a Digraph, Journal of the ACM (JACM), v.16 n.3, p.455-460, July 1969 [doi〉10.1145/321526.321534]
5. Santosh Vempala, Adrian Vetta, Factor 4/3 approximations for minimum 2-connected subgraphs, Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization, p.262-273, September 05-08, 2000