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

Authors:
Liang Zhao;Hiroshi Nagamochi;Toshihide Ibaraki
Affiliations:
Department of Information Science, Faculty of Engineering, Utsunomiya University, Utsunomiya, 321-8585, Japan;Department of Information and Computer Sciences, Toyohashi University of Technology, Toyohashi, Aichi, 441-8580, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 606-8501, Japan
Venue:
Information Processing Letters
Year:
2003

Citing 4
Cited 1

Approximating the Minimum Equivalent Digraph

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

Discrete Applied Mathematics
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
Approximating the minimum strongly connected subgraph via a matching lower bound

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

A linear time 5/3-approximation algorithm is presented for the NP-hard problem of finding a minimum strongly-connected spanning subgraph. It is based on cycle contraction that was first introduced by Khuller, Raghavachari and Young [SIAM J. Comput. 24 (1995) 859-872]. We improve their result by contracting special cycles and utilizing a more efficient data structure.