Skip to main content
Springer Nature Link
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This paper presents an \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem, where n and m denote the number of nodes and number of arcs, respectively. The algorithm is inspired by Orlin (Oper Res 41:338–350, 1993) and improves upon the previous best strongly polynomial time of \(O(\max \{m^3n, m^2\log n(m+n\log n)\})\) due to Ghiyasvand (J Comb Optim 34:203–217, 2017).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Ahuja RK, Hochbaum DS, Orlin JB (2003) Solving the convex cost integer dual network flow problem. Manage Sci 49:950–964

    Article  MATH  Google Scholar 

  • Bachelet B, Duhamel C (2009) Aggregation approach for the minimum binary cost tension problem. Eur J Oper Res 197:837–841

    Article  MATH  Google Scholar 

  • Bachelet B, Mahey P (2003) Minimum convex-cost tension problems on series-parallel graphs. RAIRO Oper Res 37(4):221–234

    Article  MathSciNet  MATH  Google Scholar 

  • Bachelet B, Mahey P (2004) Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. 4OR Q J Eur Oper Res Soc 2(4):275–291

    Article  MathSciNet  MATH  Google Scholar 

  • Berge C, Ghouila-Houri A (1962) Programming, games and transportation networks. Wiley, New York

    Google Scholar 

  • Edmonds I, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J Assoc Comput Mach 19:248–264

    Article  MATH  Google Scholar 

  • Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J Assoc Comput Mach 34:596–615

    Article  MathSciNet  Google Scholar 

  • Gabow HN (1985) Scaling algorithms for network problems. J Comput Syst Sci 31:148–168

    Article  MathSciNet  MATH  Google Scholar 

  • Ghiyasvand M (2012) An \(O(m(m+n\log n)\log (nC))\)-time algorithm to solve the minimum cost tension problem. Theor Comput Sci 448:47–55

    Article  MathSciNet  MATH  Google Scholar 

  • Ghiyasvand M (2012) A polynomial-time implementation of Pla’s method to solve the MCT problem. Adv Comput Math Its Appl 1(2):104–109

    Google Scholar 

  • Ghiyasvand M (2014) Scaling implementation of a tension rectification algorithm to solve the feasible differential problem. Sci Iran 21:980–987

    Google Scholar 

  • Ghiyasvand M (2017) A faster strongly polynomial time algorithm to solve the minimum cost tension problem. J Comb Optim 34:203–217

    Article  MathSciNet  MATH  Google Scholar 

  • Ghouila-Houri A (1964) Flots et tension dans un graphe, Ph.D Thesis, Gauthier-Villars, Paris

  • Goldberg AV, Tarjan RE (1990) Finding minimum-cost circulations by successive approximation. Math Oper Res 16:430–466

    Article  MathSciNet  MATH  Google Scholar 

  • Guler C (2008) Inverse tension problems and monotropic optimization. WIMA Report

  • Hadjiat M (1998) Penelope’s graph: a hard minimum cost tension instance. Theor Comput Sci 194:207–218

    Article  MathSciNet  MATH  Google Scholar 

  • Hadjiat M, Maurras JF (1997) A strongly polynomial algorithm for the minimum cost tension problem. Discrete Math 165(166):377–394

    Article  MathSciNet  MATH  Google Scholar 

  • Hamacher HW (1985) Min cost tension. J Inf Optim Sci 6(3):285–304

    MathSciNet  MATH  Google Scholar 

  • Karzanov A, McCormick ST (1997) Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM J Comput 26:1245–1275

    Article  MathSciNet  MATH  Google Scholar 

  • Maurras JF (1994) The maximum cost tension problem. In: Proceedings Conference, European chapter on combinatorial optimization (ECCO VII), Italy

  • Orlin JB (1993) A faster strongly polynomial minimum cost flow algorithm. Oper Res 41:338–350

    Article  MathSciNet  MATH  Google Scholar 

  • Pla JM (1971) An out-of-kilter algorithm for solving minimum cost potential problems. Math Program 1:275–290

    Article  MathSciNet  MATH  Google Scholar 

  • Rockafeller RT (1984) Network flows and monotropic optimization. Wiley, New York

    Google Scholar 

Download references

Acknowledgements

I would like to express great appreciation to the editor and three anonymous reviewers for their valuable comments and suggestions, which have helped to improve the quality and presentation of this paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran

    Mehdi Ghiyasvand

Authors
  1. Mehdi Ghiyasvand
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Mehdi Ghiyasvand.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghiyasvand, M. An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem. J Comb Optim 37, 957–969 (2019). https://doi.org/10.1007/s10878-018-0331-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0331-5

Keywords