A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q114074145, #quickstatements; #temporary_batch_1704596288873 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114074145 / rank | |||
Normal rank | |||
Revision as of 04:09, 7 January 2024
scientific article; zbMATH DE number 7572599
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case |
scientific article; zbMATH DE number 7572599 |
Statements
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (English)
0 references
18 August 2022
0 references
2-edge connectivity
0 references
approximation algorithms
0 references
subtour linear program for traveling salesman problem
0 references
