A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity (Q3603513)
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 Minimum 3-Edge-Connectivity |
scientific article; zbMATH DE number 5508787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity |
scientific article; zbMATH DE number 5508787 |
Statements
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity (English)
0 references
17 February 2009
0 references
approximation algorithms
0 references
graph and network algorithms
0 references
connectivity
0 references
combinatorial optimization
0 references
0.8756012320518494
0 references
0.8635408878326416
0 references
0.8410812616348267
0 references
