Abstract

AbstractWe study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph D = (V, A), the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. In the first problem we seek for arc lengths that minimize the length of the longest of the prescribed paths. In the second problem, the length of the longest arc is to be minimized. We show that it is 𝒩𝒫‐hard to approximate the minimal longest path length within a factor less than 8/7 or the minimal longest arc length within a factor less than 9/8. This answers the (previously) open question whether these problems are 𝒩𝒫‐hard or not. We also present a simple algorithm that achieves an 𝒪(∣V∣)‐approximation guarantee for both variants. Both ISP problems arise in the planning of telecommunication networks with shortest path routing protocols. Our results imply that it is 𝒩𝒫‐hard to decide whether a given path set can be realized with a real shortest path routing protocol such as OSPF, IS‐IS, or RIP. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(1), 29–36 2007

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 call

Disclaimer: 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.