S. Khuller, B. Raghavachari, and N. Young, Approximating the minimum equivalent digraph, SIAM J. Comput., 24 (1995), pp. 859--872. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Spanning k-arc-strong Subdigraphs with few arcs in.. - Bang-Jensen, Huang, Yeo (2001) (Correct)
Strongly Connected Spanning Subgraphs with the Minimum.. - Bang-Jensen, Huang, Yeo (2000) (Correct)
Finding small k-arc-strong Spanning Subdigraphs in.. - Bang-Jensen, Huang, Yeo (2000) (Correct)
Strongly Connected Spanning Subgraphs with the Minimum.. - Bang-Jensen, Huang, Yeo (1999) (Correct)
A Better Approximation Ratio for the Minimum Size.. - Fernandes (1998) (7 citations) (Correct)
Strongly Connected Spanning Subgraphs With the Minimum.. - Bang-Jensen, Yeo (1999) (Correct)
A Better Approximation Ratio for the Minimum k-edge-connected.. - Fernandes (1997) (2 citations) (Correct)
Approximating Minimum-Size k-Connected Spanning Subgraphs.. - Cheriyan, Thurimella (2000) (16 citations) (Correct)
Approximation Algorithms for Finding Planar and Highly Connected .. - Fernandes (1997) (Correct)
Approximating Minimum-Size k-Connected Spanning Subgraphs.. - Cheriyan, Thurimella (1998) (16 citations) (Correct)
Strongly Connected Spanning Subgraphs With the Minimum.. - Bang-Jensen, Yeo (2000) (Correct)
On Strongly Connected Digraphs with Bounded Cycle Length - Khuller, Raghavachari, Young (1996) (9 citations) Self-citation (Khuller Raghavachari Young) (Correct)
On Strongly Connected Digraphs with Bounded Cycle Length - Khuller, Raghavachari, Young (1996) (9 citations) Self-citation (Khuller Raghavachari Young) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC