A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q6058192)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7758363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case |
scientific article; zbMATH DE number 7758363 |
Statements
31 October 2023
0 references
2-edge connectivity
0 references
approximation algorithms
0 references
subtour LP for TSP
0 references
A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case (English)
0 references
0.9880129098892212
0 references
0.8593036532402039
0 references
0.8505210280418396
0 references
0.8380019664764404
0 references
