An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
From MaRDI portal
Publication:442108
DOI10.1016/j.tcs.2012.03.042zbMath1252.90086OpenAlexW221520439MaRDI QIDQ442108
Publication date: 9 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.042
Related Items (2)
A faster strongly polynomial time algorithm to solve the minimum cost tension problem ⋮ An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
Cites Work
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Aggregation approach for the minimum binary cost tension problem
- Approximate labelled subtree homeomorphism
- Scaling algorithms for network problems
- Penelope's graph: a hard minimum cost tension instance
- Finding minimum-cost flows by double scaling
- New scaling algorithms for the assignment and minimum mean cycle problems
- A strongly polynomial algorithm for the minimum cost tension problem
- Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs
- A data structure for dynamic trees
- Solving the Convex Cost Integer Dual Network Flow Problem
- Finding Minimum-Cost Circulations by Successive Approximation
- Miu Cost Tensions
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Fibonacci heaps and their uses in improved network optimization algorithms
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Flots et tensions dans un graphe
- An “out-of-kilter” algorithm for solving minimum cost potential problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
