An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659)
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: An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem |
scientific article |
Statements
An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (English)
0 references
25 June 2019
0 references
network flows
0 references
minimum cost tension problem
0 references
strongly polynomial time
0 references
0 references
0 references
0 references
