An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem
Crossref DOI link: https://doi.org/10.1007/s10878-018-0331-5
Published Online: 2018-08-06
Published Print: 2019-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ghiyasvand, Mehdi
Text and Data Mining valid from 2018-08-06
Article History
First Online: 6 August 2018