An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover (Q6953166)
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 8069657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover |
scientific article; zbMATH DE number 8069657 |
Statements
An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover (English)
0 references
24 July 2025
0 references
approximation algorithm
0 references
survivable network design
0 references
minimum 2-edge-connected spanning subgraph
0 references
triangle-free 2-matching
0 references
0 references
0 references
0 references
