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

Kurt Konolige (1994)

Details and statistics

DOI:

access: unavailable

type: Conference or Workshop Paper

metadata version: 2012-05-18

a service of  Schloss Dagstuhl - Leibniz Center for Informatics