Pancake Flipping with Two Spatulas

@article{Sharmin2008PancakeFW,
  title={Pancake Flipping with Two Spatulas},
  author={Mahfuza Sharmin and Rukhsana Yeasmin and Masud Hasan and Atif Rahman and Mohammad Sohel Rahman},
  journal={Electronic Notes in Discrete Mathematics},
  year={2008},
  volume={36},
  pages={231-238}
}
In this paper, we give approximation algorithms for several variations of the pancake flipping problem, which is also well known as the problem of sorting by prefix reversals. We consider the variations in the sorting process by adding prefix transpositions, prefix transreversals etc. along with the prefix reversals. 

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

A 1.375-Approximation Algorithm for Sorting by Transpositions

  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • 2006
VIEW 1 EXCERPT

A simpler 1.5-approximation algorithm for sorting by transpositions

T. Hartman
  • Proc. CPM’03 in:LNCS 2676,
  • 2003
VIEW 1 EXCERPT

( 1 +  ) - approximation of Sorting by Reversals and Transpositions

N. Eriksen
  • Theor . Comp . Sci .
  • 2002