Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (Q324874)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem |
scientific article |
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
