Giri Narasimhan and Michiel Smid

- For a table of contents, see the publisher's website
- Available in eBook format
- Errata
- Progress on open problems mentioned in the book
- Updates for the Bibliography
- New references
- Notes on binary dumbbell trees
- Chapter 11 contains a detailed description of non-binary dumbbell trees. These notes show how binary dumbbell trees can be obtained, and how they can be used to construct, in O(n log n) time, a spanner of bounded degree and weight proportional to O(log n) times the weight of a minimum spanning tree.

- Solutions to Exercise 14.11 and Exercise 14.15