Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092): 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.1002/net.20289 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4240507476 / rank | |||
Normal rank | |||
Revision as of 21:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding |
scientific article |
Statements
Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (English)
0 references
24 November 2010
0 references
approximation algorithms
0 references
network design
0 references
graph connectivity
0 references
edge connectivity
0 references
linear program
0 references
LP-rounding
0 references
MAX SNP-hardness
0 references
