On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587)
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: On the minimum-cost -edge-connected k-subgraph problem |
scientific article; zbMATH DE number 6950362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem |
scientific article; zbMATH DE number 6950362 |
Statements
On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (English)
0 references
10 October 2018
0 references
edge-connected subgraph
0 references
minimum spanning tree
0 references
integer programming
0 references
graph connectivity
0 references
valid inequalities
0 references
0 references
0 references
0.851780354976654
0 references
0.8471711277961731
0 references
0.8077570199966431
0 references
0.8056366443634033
0 references
