Kruskal's algorithm is one of these things for the cycle matroid, and in general, these things, along with independence oracles, can be used to determine a maximum-weight basis for matroids.
Korte and Lovasz introduced a variety of matroids named after this concept for which this concept is always optimal for them. Kruskal's algorithm is one of these things for the cycle matroid, and in general, these things, along with independence oracles, can be used to determine a maximum-weight basis for matroids. For every number of cities in the traveling salesman problem, one can always assign distances between them such that this type of process  nds the unique worst possible solution. In the case of the traveling salesman problem, the   nearest neighbor algorithm is one of these things. For ten points, identify this general class of algorithm which always makes the best short-term choice.
Korte and Lovasz introduced a variety of matroids named after this concept for which this concept is always optimal for them.
greedy algorithms   