Douglas Adams

Suggest Changes
Learn More
Many problems that can be correctly solved by greedy algorithms can be described in terms of an abstract combinatorial object called a matroid. Matroids were first described in 1935 by the(More)