Before revision:  This algorithm , named 'burning greedy permutation' algorithm, is based on greedy permutations and is easy to implement .
After revision:  This algorithm , named 'burning greedy permutation' algorithm, is based on farthest-first traversal, it is easy to implement .