One-Hop Greedy Permutations

Rather than adding the farthest point at each step, the one-hop greedy permutation searches a neighborhood around the farthest point. It adds the point in this neighborhood that covers the most points that are not already covered.