The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time

@inproceedings{Firoz2010The1A,
  title={The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time},
  author={Jesun Sahariar Firoz and Masud Hasan and Ashik Zinnat Khan and Mohammad Sohel Rahman},
  booktitle={WALCOM},
  year={2010}
}

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…