Greedy-type resistance of combinatorial problems

This paper gives a sufficient condition for a combinatorial problem to be greedy-type resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will output the unique worst possible solution. The condition is used to show that the Equipartition, the kk-Clique, the Asymmetric Traveling Salesman, the Hamiltonian Path, the Min–Max Matching, and the Assignment Problems are all greedy-type resistant.