A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs |
scientific article |
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