ConceptSystems & CS
Minimum spanning tree (MST) lower bound
Using the weight of a minimum spanning tree over the remaining unvisited cities as a lower bound for the remaining travel distance in a search tree.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.