Your Waterstones card is changing, introducing...
Euclidean Shortest Paths: Exact or Approximate Algorithms (Paperback)
  • Euclidean Shortest Paths: Exact or Approximate Algorithms (Paperback)

Euclidean Shortest Paths: Exact or Approximate Algorithms (Paperback)

(author), (author)
Paperback 378 Pages / Published: 25/01/2014
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs in the plane; examines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curves; describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems; includes lists of symbols and abbreviations, in addition to other appendices.

Publisher: Springer London Ltd
ISBN: 9781447160649
Number of pages: 378
Weight: 605 g
Dimensions: 235 x 155 x 21 mm
Edition: 2011 ed.


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)

You may also be interested in...

The Elements of Statistical Learning
Added to basket
Added to basket
Foundation Mathematics
Added to basket
How to Think About Algorithms
Added to basket
Added to basket
Discrete Mathematics
Added to basket
The Algorithm Design Manual
Added to basket
Mixed media product
Bayesian Methods for Hackers
Added to basket
The End of Error
Added to basket
MATLAB Demystified
Added to basket
Concrete Mathematics
Added to basket
The Art of Computer Programming
Added to basket
Data Analysis with Open Source Tools
Added to basket
A First Course in Coding Theory
Added to basket


Please sign in to write a review

Your review has been submitted successfully.