Login / Signup
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Liang Zhao
Hiroshi Nagamochi
Toshihide Ibaraki
Published in:
Inf. Process. Lett. (2003)
Keyphrases
</>
strongly connected
directed graph
optimum path forest
approximation algorithms
worst case
np hard
constant factor
error bounds
graph mining
search algorithm
graph properties
undirected graph
search space
data structure
approximation methods
complex networks
special case
min sum