A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating the Minimum Equivalent Digraph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On strongly connected digraphs with bounded cycle length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2768327 / rank | |||
Normal rank | |||
| 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 10: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
