On the cycle augmentation problem: hardness and approximation algorithms (Q2230719)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the cycle augmentation problem: hardness and approximation algorithms |
scientific article; zbMATH DE number 7402289
| 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 7402289 |
Statements
On the cycle augmentation problem: hardness and approximation algorithms (English)
0 references
28 September 2021
0 references
approximation algorithms
0 references
connectivity augmentation
0 references
cactus augmentation
0 references
cycle augmentation
0 references
0 references
0 references
0 references
0.7953888177871704
0 references
0.7944263219833374
0 references
0.7930234670639038
0 references
0.7905494570732117
0 references
