Edge capacity augmentation problem on spanning trees in networks (Q4980319)
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: Edge capacity augmentation problem on spanning trees in networks |
scientific article; zbMATH DE number 6311119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge capacity augmentation problem on spanning trees in networks |
scientific article; zbMATH DE number 6311119 |
Statements
30 June 2014
0 references
spanning tree
0 references
edge capacity augmentation
0 references
strong polynomial algorithm
0 references
\(T\)-exchange
0 references
lexicographical order
0 references
0.778641402721405
0 references
0.7646698355674744
0 references
0.7592206001281738
0 references
