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

Mehdi Ghiyasvand. An $$O(n(m+n\log n)\log n)$$ O ( n ( m + n log n ) log n ) time algorithm to solve the minimum cost tension problem. J. Comb. Optim., 37(3):957-969, 2019. [doi]

@article{Ghiyasvand19,
  title = {An $$O(n(m+n\log n)\log n)$$ O ( n ( m + n log n ) log n ) time algorithm to solve the minimum cost tension problem},
  author = {Mehdi Ghiyasvand},
  year = {2019},
  doi = {10.1007/s10878-018-0331-5},
  url = {https://doi.org/10.1007/s10878-018-0331-5},
  researchr = {https://researchr.org/publication/Ghiyasvand19},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {37},
  number = {3},
  pages = {957-969},
}