Approximating the Minimum Equivalent Digraph

Abstract

The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives an approximation algorithm with performance guarantee of pi^2/6 ~ 1.64. The algorithm and its analysis are based on the simple idea of contracting long cycles. (This result is strengthened slightly in ``On strongly connected digraphs with bounded cycle length'' (1996).) The analysis applies directly to 2-Exchange, a simple ``local improvement'' algorithm, showing that its performance guarantee is 1.75.

conference version in ACM-SIAM Symposium on Discrete Algorithms (1994)

Cited by in corpus (11)

• On Strongly Connected Digraphs with Bounded Cycle Length
• Redundancy in Logic II: 2CNF and Horn Propositional Formulae
• Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks
• Compositions of Digraphs: A Survey
• An Algebra of Lightweight Ontologies
• Approximating Transitivity in Directed Networks
• Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
• Minimum Equivalent Precedence Relation Systems
• Correspondent Banking Networks: Theory and Experiment
• Semicomplete Compositions of Digraphs
• An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph