Approximating the minimum strongly connected subgraph via a matching lower bound

Authors:
Adrian Vetta
Affiliations:
Dept. of Mathematics, M.I.T.
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 4
Cited 8

Approximating the Minimum Equivalent Digraph

SIAM Journal on Computing
On strongly connected digraphs with bounded cycle length

Discrete Applied Mathematics
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

Journal of the ACM (JACM)
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

Journal of the ACM (JACM)

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem

Information Processing Letters
Special edges, and approximating the smallest directed k-edge connected spanning subgraph

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The minimum spanning strong subdigraph problem is fixed parameter tractable

Discrete Applied Mathematics
Approximating Transitive Reductions for Directed Networks

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On approximate horn formula minimization

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Min-power strong connectivity

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A rounding by sampling approach to the minimum size k-arc connected subgraph problem

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A novel method for signal transduction network inference from indirect experimental evidence

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a 3/2-approximation algorithm for the problem of finding a minimum strongly connected spanning subgraph in a given directed graph. As a corollary we obtain a 3/2-approximation algorithm for the more general minimum equivalent digraph problem. The performance of our algorithm is measured against a lower bound obtained from a simple matching problem. The performance guarantee is optimal with respect to the lower bound.