Euclidean Shortest Paths Exact or Approximate Algorithms

From the book reviews:

“This book presents selected algorithms for the exact or approximate solution of several variants of the Euclidean shortest path problem (ESP). … The book has been successful in addressing the Euclidean Shortest Path problems by presenting exact and approximate algorithms in the light of rubberband algorithms, and will be immensely useful to students and researchers in the area.” (Arindam Biswas, IAPR Newsletter, Vol. 37 (1), January, 2015)

“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. … this is the first book-length treatment of the topic. The entire text is accessible to advanced undergraduates. … Summing Up: Highly recommended. Upper-division undergraduates, graduate students, and researchers/faculty.” (M. Bona, Choice, Vol. 49 (9), May, 2012)

From the reviews:"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. ... this is the first book-length treatment of the topic. The entire text is accessible to advanced undergraduates. ... Summing Up: Highly recommended. Upper-division undergraduates, graduate students, and researchers/faculty." (M. Bona, Choice, Vol. 49 (9), May, 2012)