Easy to be Hard: Difficult Problems for Greedy Algorithms

Kurt Konolige. Easy to be Hard: Difficult Problems for Greedy Algorithms. In KR. pages 374-378, 1994.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.