The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:31, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm |
scientific article |
Statements
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (English)
0 references
26 June 2020
0 references
2-edge connected graph
0 references
2-edge covers
0 references
approximation algorithms
0 references
bridges
0 references
connectivity augmentation
0 references
forest augmentation problem
0 references
matching augmentation problem
0 references
network design
0 references