Searching for the Shortest Network

One of the oldest geometrical problems is that of connecting together a set of points by a network having the shortest possible total length. In spite of its apparent simplicity, the general problem is still very far from being completely solved. In this talk we will survey what is currently known about this problem, and describe how some of the recent fundamental advances in theoretical computer science have shed light on the reasons underlying its difficulty.