Sciweavers

74
Voted
DISOPT
2006
101views more  DISOPT 2006»
14 years 8 months ago
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 o...
Gareth Bendall, François Margot