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

Mehdi Ghiyasvand ()
Additional contact information
Mehdi Ghiyasvand: Bu-Ali Sina University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 3, No 10, 957-969

Abstract: Abstract This paper presents an $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) 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)\})$$O(max{m3n,m2logn(m+nlogn)}) due to Ghiyasvand (J Comb Optim 34:203–217, 2017).

Keywords: Network flows; Minimum cost tension problem; Strongly polynomial time (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0331-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0331-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0331-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().