The minimum cover flow problem in networks (Q5260320)
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: The minimum cover flow problem in networks |
scientific article; zbMATH DE number 6453695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum cover flow problem in networks |
scientific article; zbMATH DE number 6453695 |
Statements
29 June 2015
0 references
network flow
0 references
minimum cover flow
0 references
polynomial-time algorithm
0 references
0.8082559108734131
0 references
0.7947104573249817
0 references
