Approximating the Minimum Equivalent Digraph
Samir Khuller, Balaji Raghavachari, Neal E. Young
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 pi2/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.
Create a lesson
Related papers
Distributed (Δ+1)-Coloring in O(Δ+* n) Rounds
Marc Fuchs, Fabian Kuhn
Ramsey Meets Simultaneous Planarity: Vertex Integrity and Pathwidth
Thomas Depian, Simon D. Fink, Alexander Firbas et al.
Hashrope: A Persistent Data Structure for Mechanisms of LLM Context Management
Muntaser Syed, Ameerah Alsulami, Marius Silaghi
Approximation algorithms via discrepancy with hard constraints
Mikhail Cherniavskii, Andrey Kupavskii, Stanislav Moiseev et al.
Improved Approximations for Coflow Scheduling via Iterated Rounding and Stable Matchings
Mikhail Cherniavskii, Arseni Fedorovich, Mikhail Koshelev et al.
Online Submodular Welfare Maximization: Computation is not the Bottleneck
Rajan Udwani, David Wajc