| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652734 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
