A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees (Classic Reprint)

Angebote / Angebote:

Excerpt from A Performance Comparison of Labeling Algorithms for Calculating Shortest Path TreesIn many an analysis of communication and transportation systems, the problem of finding the shortest, cheapest, or fastest route between two points arises naturally. One may wish to determine, for instance, the least cost route to travel by auto between two cities or alter natively the auto route which is fastest. One may want to route a telephone call along telephone lines to minimize the length of the lines over which the call travels.About the PublisherForgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.comThis book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully, any imperfections that remain are intentionally left to preserve the state of such historical works.