A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988)
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 7638589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem |
scientific article; zbMATH DE number 7638589 |
Statements
A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (English)
0 references
5 January 2023
0 references
minimum 2-edge-connected spanning subgraph problem
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
0.9012182950973512
0 references
0.8690528869628906
0 references
0.8673645257949829
0 references
