Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (Q324874)
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: Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem |
scientific article; zbMATH DE number 6639930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem |
scientific article; zbMATH DE number 6639930 |
Statements
Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (English)
0 references
17 October 2016
0 references
minimum cost 2-edge connected subgraph problem
0 references
approximation algorithm
0 references
integrality gap
0 references
0 references
0.97112637758255
0 references
0.8655462265014648
0 references
0.8441662788391113
0 references
