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

Mehdi Ghiyasvand. An O(m(m + n log n) log(n C))-time algorithm to solve the minimum cost tension problem. Theoretical Computer Science, 448:47-55, 2012. [doi]

@article{Ghiyasvand12,
  title = {An O(m(m + n log n) log(n C))-time algorithm to solve the minimum cost tension problem},
  author = {Mehdi Ghiyasvand},
  year = {2012},
  doi = {10.1016/j.tcs.2012.03.042},
  url = {http://dx.doi.org/10.1016/j.tcs.2012.03.042},
  researchr = {https://researchr.org/publication/Ghiyasvand12},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {448},
  pages = {47-55},
}