Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544)
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 Spanning Subgraph |
scientific article; zbMATH DE number 6723121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph |
scientific article; zbMATH DE number 6723121 |
Statements
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (English)
0 references
24 May 2017
0 references
minimum cost 2-edge connected spanning subgraph problem
0 references
approximation algorithm
0 references
integrality gap
0 references
cubic graphs
0 references
0 references
0 references
