Greedy Heuristic

The greedy heuristic sorts the edges according to their weights resp. scores in descending order and picks the first in the list. The next selected edge is not conflicting with the previously picked. This continues until k-1 edges have been selected.

Back to Peak Scoring Settings