A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:04, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem |
scientific article |
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
