A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336)
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 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs |
scientific article; zbMATH DE number 6581512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs |
scientific article; zbMATH DE number 6581512 |
Statements
A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (English)
0 references
18 May 2016
0 references
approximation algorithms
0 references
minimum 2-edge connected spanning subgraphs
0 references
\(\{3,4\}\)-covering 2-factors
0 references
0.9149296
0 references
0.9025351
0 references
0.8964965
0 references
0.89566797
0 references
0.8945768
0 references
0.89346033
0 references
0 references
0.88633394
0 references
0.8812824
0 references
