A rounding by sampling approach to the minimum size \(k\)-arc connected subgraph problem (Q2843285)
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 6197707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A rounding by sampling approach to the minimum size \(k\)-arc connected subgraph problem |
scientific article; zbMATH DE number 6197707 |
Statements
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (English)
0 references
12 August 2013
0 references
0.8016383647918701
0 references
0.7964951395988464
0 references
0.7924216389656067
0 references
0.791697084903717
0 references
0.7851121425628662
0 references
