A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:45, 5 March 2024
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
