Before revision:  This algorithm , named 'burning greedy permutation' algorithm, is based on greedy permutations and is easy to implement . According to a brief empirical analysis, the proposed algorithm generates competitive solutions , some of which are better than the best previously known .
After revision:  This algorithm , named 'burning greedy permutation' algorithm, is based on greedy permutations and is easy to implement , and according to a brief empirical analysis, the proposed algorithm generates competitive solutions , some of which are better than the best previously known .