I will discuss algorithms (old and new) for finding minimum spanning trees
of bounded degree. The talk discusses problems and techniques that are
both geometrical and graph-theoretic in nature. The basic problem is
NP-hard, and I will outline worst case approximation algorithms that
are very intuitive. Interesting open problems will also be mentioned.
This will be a survey of two papers.