Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem (Q3596353)
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 5185471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem |
scientific article; zbMATH DE number 5185471 |
Statements
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem (English)
0 references
30 August 2007
0 references
0.8702601194381714
0 references
0.8673645257949829
0 references
0.8659131526947021
0 references
0.8635408878326416
0 references