An improved approximation algorithm for the matching augmentation problem (Q6147541)
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 7788611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for the matching augmentation problem |
scientific article; zbMATH DE number 7788611 |
Statements
15 January 2024
0 references
2-edge connected graph
0 references
2-edge covers
0 references
approximation algorithms
0 references
connectivity augmentation
0 references
forest augmentation problem
0 references
matching augmentation problem
0 references
network design
0 references
0.9918662309646606
0 references
0.9386387467384338
0 references
0.8588693737983704
0 references
0.7953231930732727
0 references
0.7883549928665161
0 references
