Items related to A Performance Comparison of Labeling Algorithms for...
A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees (Classic Reprint) - Softcover
Synopsis
Excerpt from A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees<br/><br/>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.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2024
- ISBN 10 0365646105
- ISBN 13 9780365646105
- BindingPaperback
- LanguageEnglish
- Number of pages100
Buy New
View this item
US$ 18.30
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speeds
Search results for A Performance Comparison of Labeling Algorithms for...
Seller Image
A Performance Comparison of Labeling Algorithms for Calculating Shortest Path
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. 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. print-on-demand item. Seller Inventory # 9780365646105_0
Quantity: Over 20 available