Abstract
The shortest-path problem in a network is to find shortest paths between some specified sources and terminals when the lengths of edges are given. This paper studies a reverse problem: how to shorten the lengths of edges with as less cost as possible such that the distances between specified sources and terminals are reduced to the required bounds. This can be regarded as a routing speed-up model in transportation networks. In this paper, for the general problem, the NP-completeness is shown, and for the case of trees and the case of single source-terminal, polynomial-time algorithms are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
