Approximating subset \(k\)-connectivity problems (Q2376789)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating subset k-connectivity problems |
scientific article; zbMATH DE number 6180266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating subset \(k\)-connectivity problems |
scientific article; zbMATH DE number 6180266 |
Statements
Approximating subset \(k\)-connectivity problems (English)
0 references
24 June 2013
0 references
graph connectivity
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.995762288570404
0 references
0.9044141173362732
0 references
0.8979099988937378
0 references
0.8668439984321594
0 references
0.8653051257133484
0 references
