On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105)
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 \(k\)-connectivity problems with sharpened triangle inequality |
scientific article; zbMATH DE number 5509891
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \(k\)-connectivity problems with sharpened triangle inequality |
scientific article; zbMATH DE number 5509891 |
Statements
On \(k\)-connectivity problems with sharpened triangle inequality (English)
0 references
23 February 2009
0 references
approximation algorithms
0 references
combinatorial problems
0 references
minimum-cost \(k\)-connected spanning subgraph
0 references
graph algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9667394
0 references
0 references
0.89534765
0 references
0.8885988
0 references
0.8881416
0 references
0.8868772
0 references
0.88338196
0 references
