Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201)
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 k-generalized connectivity via collapsing HSTs |
scientific article; zbMATH DE number 6475137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating \(k\)-generalized connectivity via collapsing HSTs |
scientific article; zbMATH DE number 6475137 |
Statements
Approximating \(k\)-generalized connectivity via collapsing HSTs (English)
0 references
24 August 2015
0 references
approximation algorithms
0 references
generalized connectivity
0 references
probabilistic embedding into HSTs
0 references
group Steiner tree
0 references
dense \(k\)-subgraph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88253003
0 references
0.88253003
0 references
0.8657139
0 references
0.8657139
0 references
0.86404145
0 references
0.8576643
0 references
0.8551174
0 references
0.8519839
0 references
