A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear time 53-approximation for the minimum strongly-connected spanning subgraph problem |
scientific article; zbMATH DE number 5530908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem |
scientific article; zbMATH DE number 5530908 |
Statements
A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (English)
0 references
23 March 2009
0 references
approximation algorithms
0 references
strongly connected subgraph
0 references
cycle contraction
0 references
0.8506082892417908
0 references
0.8012074828147888
0 references
0.8012073636054993
0 references
