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.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780365646181
Quantity: 15 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780365646181
Quantity: 15 available