Scaling algorithms for network problems
Journal of Computer and System Sciences
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Finding minimum-cost flows by double scaling
Mathematical Programming: Series A and B
New scaling algorithms for the assignment and minimum mean cycle problems
Mathematical Programming: Series A and B
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
Discrete Applied Mathematics
A strongly polynomial algorithm for the minimum cost tension problem
Proceedings of an international symposium on Graphs and combinatorics
Penelope's graph: a hard minimum cost tension instance
Theoretical Computer Science
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Solving the Convex Cost Integer Dual Network Flow Problem
Management Science
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
| Hi-index | 5.23 |
This paper presents a new polynomial-time algorithm to solve the minimum cost tension problem. It runs in O(m(m+nlogn)log(nC))-time, where n,m,C denote the number of nodes, number of arcs, and maximum arc capacity value of an arc cost, respectively. The algorithm improves the O(m^2nlogC)-time algorithm of Maurras (1994) [20]. Also our algorithm, under the similarity assumption (Gabow, 1985) [12], runs in O(m(m+nlogn)logn)-time, which improves the O(n^4m^3logn)-time algorithm of Hadjiat and Maurras (1997) [18].