Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-009-9256-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050873015 / rank | |||
Normal rank | |||
Revision as of 00:58, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating \(k\)-generalized connectivity via collapsing HSTs |
scientific article |
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
