A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(02)00476-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020856645 / rank | |||
Normal rank | |||
Latest revision as of 11:54, 30 July 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
