A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem |
scientific article |
Statements
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (English)
0 references
12 August 2013
0 references
