A faster strongly polynomial time algorithm to solve the minimum cost tension problem

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

Journal of Combinatorial Optimization, 2017, vol. 34, issue 1, No 14, 203-217

Abstract: Abstract This paper presents a strongly polynomial time algorithm for the minimum cost tension problem, which runs in $$O(\max \{m^3n, m^2 \log n(m+n \log n)\})$$ O ( max { m 3 n , m 2 log n ( m + n log n ) } ) time, where n and m denote the number of nodes and number of arcs, respectively. Our algorithm improves upon the previous strongly polynomial time of $$O(n^4 m^3 \log n)$$ O ( n 4 m 3 log n ) due to Hadjiat and Maurras (Discret Math 165(166):377–394, 1997).

Keywords: Tension problems; The minimum cost tension problem; Strongly polynomial time (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0070-4 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:34:y:2017:i:1:d:10.1007_s10878-016-0070-4

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

DOI: 10.1007/s10878-016-0070-4

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 ().