Euclidean Shortest Paths
Exact and Approximate Algorithms
Springer, London, December 2011
Springer’s website for the book
Review by `Choice Review’
Li (Huaqiao Univ., China) and Klette (Univ. of Auckland, New Zealand) have written an interesting and very reader-friendly book on algorithms that find a shortest path between two vertices of a graph. The notion of distance is the one in Euclidean geometry, and all problems considered are two- or three-dimensional. To this reviewer’s knowledge, this is the first book-length treatment of the topic. The entire text is accessible to advanced undergraduates. The only room for improvement relates to the exercises. There are not quite enough of them, about 15 per chapter, and half are not classic exercises–they are either computer programming exercises or invitations to discuss a family of problems. There is nothing wrong with either of these, but they should be in addition to the classic mathematical exercises, not instead of them. Many readers of this book will be in early stages of their development and will need more exercises to strengthen their knowledge. Summing Up: Highly recommended. Upper-division undergraduates, graduate students, and researchers/faculty.
Miklos Bona, University of Florida, USA
Copyright American Library Association, used with permission.
- Cover of Book
- Foreword to the book by Professor Ron Kimmel, Haifa (pdf, 70 KB)
- Some Front Pages (pdf, 2.8 MB)
- Book index (pdf, 1 MB)
- Reading sample: end of Chapter 1 (pdf, 2.6 MB)