Euclidean Shortest Paths: Exact or Approximate Algorithms - Image 1

£115.87

Springer Euclidean Shortest Paths: Exact or Approximate Algorithms

Name: Euclidean Shortest Paths: Exact or Approximate Algorithms
Brand: Springer
Price: 115.17 GBP
Availability: InStock

Algorithms

Price History & Forecast

Last 89 days • 89 data points

Historical

Generating forecast...

Price Distribution

Price distribution over 89 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £115 (85 days, 95.5%)

Price range: £115 - £116

Price levels: 2 different prices over 89 days

Description

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 1447160649
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Publication Date: 25 January 2014
Listed Since: 05 December 2013

Barcode

No barcode data available

Springer Euclidean Shortest Paths: Exact or Approximate Algorithms

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Euclidean Shortest Paths: Exact or Approximate Algorithms

Springer - Green Transportation and Vehicle Routing Problems

The Shortest Path Problem: Ninth DIMACS Implementation Challenge (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)

Search Theory: A Game Theoretic Perspective

Robot Path Planning and Cooperation: Foundations, Algorithms and Experimentations: 772 (Studies in Computational Intelligence, 772)

Springer Robot Path Planning and Cooperation - Studies in CI 772

Nature Inspired Optimisation for Delivery Problems: From Theory to the Real World (Natural Computing Series)

Routing Problems in Multicast Networks: Approximation lower bounds and heuristics

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

CRC Press Advanced Routing of Electronic Modules: 2 Book

Springer - The Mathematics of Paul Erd s I - Math Book

The Mathematics of Paul Erdős I

Defense Transportation: Algorithms, Models and Applications for the 21st Century

Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings: 3669 (Lecture Notes in Computer Science, 3669)

Metaheuristics for Vehicle Routing Problems (Computer Engineering: Metaheuristics Set, 3)

Oxford University Press - Geometry, Topology, and Math Physics 212

Computational Geometry: Lectures at the Morningside Center of Mathematics: 34 (AMS/IP Studies in Advanced Mathematics)

Mathematics & Mathematics Education: Searching for Common Ground (Advances in Mathematics Education)

Proceedings of the Fourteenth International Conference on Management Science and Engineering Management: Volume 2: 1191 (Advances in Intelligent Systems and Computing, 1191)

Arc Routing: Theory, Solutions and Applications

Arc Routing: Theory, Solutions and Applications

Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition)

Parameterized Algorithms

Algorithms for Smart World Technologies: A Comprehensive Guide to Applications in AI, IoT and Automation for Electrical and Computer Engineers