A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (Q4973051): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127112599, #quickstatements; #temporary_batch_1722364966119 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3341599 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2979731478 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127112599 / rank | |||
Normal rank | |||
Latest revision as of 19:58, 30 July 2024
scientific article; zbMATH DE number 7138985
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem |
scientific article; zbMATH DE number 7138985 |
Statements
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (English)
0 references
2 December 2019
0 references
approximation algorithms
0 references
graph connectivity
0 references
