did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9780821843833

The Shortest Path Problem

by ; ;
  • ISBN13:

    9780821843833

  • ISBN10:

    0821843834

  • Format: Hardcover
  • Copyright: 2009-08-26
  • Publisher: Amer Mathematical Society

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
  • Write a Review Icon Write a Review
List Price: $117.00 Save up to $39.19
  • Rent Book $77.81
    Add to Cart Free Shipping Icon Free Shipping

    TERM
    PRICE
    DUE
    USUALLY SHIPS IN 3-5 BUSINESS DAYS
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.

Supplemental Materials

What is included with this book?

Summary

Real-world applications of shortest path algorithms by J. L. Santos An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags by U. Lauther Fast point-to-point shortest path computations with arc-flags by M. Hilger, E. Kohler, R. H. Mohring, and H. Schilling High-performance multi-level routing by D. Delling, M. Holzer, K. Muller, F. Schulz, and D. Wagner Reach for A*: shortest path algorithms with preprocessing by A. V. Goldberg, H. Kaplan, and R. F. Werneck Highway hierarchies star by D. Delling, P. Sanders, D. Schultes, and D. Wagner Ultrafast shortest-path queries via transit nodes by H. Bast, S. Funke, and D. Matijevic Robust, almost constant time shortest-path queries in road networks by P. Sanders and D. Schultes Single-source shortest paths with the parallel boost graph library by N. Edmonds, A. Breuer, D. Gregor, and A. Lumsdaine Parallel shortest path algorithms for solving large-scale instances by K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak Breadth first search on massive graphs by D. Ajwani, U. Meyer, and V. Osipov Engineering label-constrained shortest-path algorithms by C. L. Barrett, K. Bisset, M. Holzer, G. Konjevod, M. V. Marathe, and D. Wagner Bibliography by C. Demetrescu, A. V. Goldberg, and D. S. Johnson

Table of Contents

Real-world applications of shortest path algorithms
An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
Fast point-to-point shortest path computations with arc-flags
High-performance multi-level routing
Reach for A*: shortest path algorithms with preprocessing
Highway hierarchies star
Ultrafast shortest-path queries via transit nodes
Robust, almost constant time shortest-path queries in road networks
Single-source shortest paths with the parallel boost graph library
Parallel shortest path algorithms for solving large-scale instances
Breadth first search on massive graphs
Engineering label-constrained shortest-path algorithms
Bibliography
Table of Contents provided by Publisher. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program