Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6546407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing minimum changeover cost arborescenses in bounded treewidth graphs |
scientific article; zbMATH DE number 6546407 |
Statements
Constructing minimum changeover cost arborescenses in bounded treewidth graphs (English)
0 references
26 February 2016
0 references
reload cost
0 references
changeover cost
0 references
cactus graphs
0 references
bounded treewidth graphs
0 references
network design
0 references
0.9031605124473572
0 references
0.8515313863754272
0 references
0.8190137147903442
0 references
