On the Cycle Augmentation Problem: hardness and approximation algorithms (Q2193089)
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 7238564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Cycle Augmentation Problem: hardness and approximation algorithms |
scientific article; zbMATH DE number 7238564 |
Statements
On the Cycle Augmentation Problem: hardness and approximation algorithms (English)
0 references
24 August 2020
0 references
approximation algorithms
0 references
connectivity augmentation
0 references
cactus augmentation
0 references
cycle augmentation
0 references
1.0000001
0 references
0.9097868
0 references
0.8986736
0 references
0.8728329
0 references
0.8711847
0 references
0 references
0.87003106
0 references
0.86816245
0 references
0.8668719
0 references
