A faster strongly polynomial time algorithm to solve the minimum cost tension problem

This paper presents a strongly polynomial time algorithm for the minimum cost tension problem, which runs in O ( max { m 3 n , m 2 log n ( m + n log n ) } ) time, where n and m denote the number of nodes and number of arcs, respectively. Our algorithm improves upon the previous strongly polynomial t...

Ausführliche Beschreibung