A Performance Comparison of Labeling Algorithms for Calculating Shortest Path

Judith Gilsinn, Christoph Witzgall

ISBN 10: 0365646105 / ISBN 13: 9780365646105

Published by Forgotten Books, 2024

About this Item

Print on Demand. This book explores different labeling techniques for calculating the shortest paths between points in a network, a problem that arises in many disciplines and has been the subject of considerable research. The author examines one class of these techniques, known as labeling algorithms, and provides a detailed comparison of their computational efficiency on various types and sizes of networks. The book begins with the basic definitions and background relating to network structures appearing in the algorithms, and then describes the two basic algorithms in this class. It goes on to present several techniques that can be used to improve the efficiency of the basic algorithms, including list processing techniques, sequencing techniques, and pointer strategies. The author includes a detailed discussion of the relative merits of the various techniques for different types of networks, and provides a set of computational experiments and a discussion of the results. The book concludes with a summary of the findings and a discussion of the implications for the design of efficient labeling algorithms. This book provides a valuable resource for researchers and practitioners in the field of network optimization, and will be of interest to anyone concerned with the efficient computation of shortest paths in networks. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. Seller Inventory # 9780365646105_0

Bibliographic Details

Title: A Performance Comparison of Labeling ...

Publisher: Forgotten Books

Publication Date: 2024

Binding: Paperback

Condition: New

Book Type: print-on-demand item

About this title

Synopsis:

Excerpt from A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees

In 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 Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This 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.