A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (Q4973051)
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 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem |
scientific article; zbMATH DE number 7138985
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem |
scientific article; zbMATH DE number 7138985 |
Statements
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (English)
0 references
2 December 2019
0 references
approximation algorithms
0 references
graph connectivity
0 references
