An O(m(m+n n)(nC))-time algorithm to solve the minimum cost tension problem

DOI10.1016/J.TCS.2012.03.042MaRDI QIDQ442108zbMATH OpenOpenAlexFDO

Authors Mehdi Ghiyasvand

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

zbMATH Keywords

minimum cost tension problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Programming involving graphs or networks (90C35)

Recommendations

• 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
• A strongly polynomial algorithm for the minimum cost tension problem
• Miu Cost Tensions
• Penelope's graph: a hard minimum cost tension instance

Cites work

• A data structure for dynamic trees
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A strongly polynomial algorithm for the minimum cost tension problem
• Aggregation approach for the minimum binary cost tension problem
• An “out-of-kilter” algorithm for solving minimum cost potential problems
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Approximate labelled subtree homeomorphism
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding Minimum-Cost Circulations by Successive Approximation
• Finding minimum-cost flows by double scaling
• Flots et tensions dans un graphe
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 1766747 (Why is no real title available?)
• Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs
• Miu Cost Tensions
• Network flows. Theory, algorithms, and applications.
• New scaling algorithms for the assignment and minimum mean cycle problems
• Penelope's graph: a hard minimum cost tension instance
• Scaling algorithms for network problems
• Solving the convex cost integer dual network flow problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow

Cited in

(6)

• New algorithms for convex cost tension problem with application to computer vision
• Penelope's graph: a hard minimum cost tension instance
• A strongly polynomial algorithm for the minimum cost tension problem
• 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
• Miu Cost Tensions

This page was built for publication: An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442108)