A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2129322254 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1205.1262 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:00, 19 April 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
