A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs (Q1941534)
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: A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs |
scientific article; zbMATH DE number 6144144
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs |
scientific article; zbMATH DE number 6144144 |
Statements
A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs (English)
0 references
13 March 2013
0 references
approximation algorithms
0 references
LP relaxations
0 references
iterative rounding method
0 references
graph connectivity
0 references
\(k\)-connected spanning subgraphs
0 references
extreme point solutions
0 references
