"Easy to be Hard: Difficult Problems for Greedy Algorithms."

Kurt Konolige (1994)
a service of Schloss Dagstuhl - Leibniz Center for Informatics