Advanced
Discrete Mathematics & Math
Q93 / 100
What is a matroid and its connection to greedy algorithms?
Correct! Well done.
Incorrect.
The correct answer is B) An abstraction of linear independence satisfying exchange axioms — the greedy algorithm finds a maximum weight basis in any matroid, exactly capturing when greedy is optimal
B
Correct Answer
An abstraction of linear independence satisfying exchange axioms — the greedy algorithm finds a maximum weight basis in any matroid, exactly capturing when greedy is optimal
Explanation
Matroids (Whitney 1935): ground set + independent sets satisfying hereditary and augmentation properties. The greedy algorithm on a matroid always finds a maximum weight basis. Graphic (spanning trees), linear, uniform, partition, and transversal matroids.
Progress
93/100