Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

We 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, the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. The first problem seeks 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 NP-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 NP-hard or not. We also present a simple algorithm that achieves an O(|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 NP-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.

[1]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .

[2]  Philippe L. Toint,et al.  On an instance of the inverse shortest paths problem , 1992, Math. Program..

[3]  Martin Grötschel,et al.  Design of broadband virtual private networks: Model and heuristics for the B-WiN , 1998, Robust Communication Networks: Interconnection and Survivability.

[4]  Sándor P. Fekete,et al.  The complexity of an inverse shortest paths problem , 1997, Contemporary Trends in Discrete Mathematics.

[5]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[6]  Andreas Bley,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin a Lagrangian Approach for Integrated Network Design and Routing in Ip Networks a Lagrangian Approach for Integrated Network Design and Routing in Ip Networks * , 2022 .

[7]  M. Piórob,et al.  On OSPF Related Network Optimisation Problems , 2022 .

[8]  Toshihide Ibaraki,et al.  An efficient algorithm for K shortest simple paths , 1982, Networks.

[9]  Didier Burton,et al.  On the Inverse Shortest Path Problem , 1993 .

[10]  K. P. Lam,et al.  An embedded connectionist approach for the inverse shortest paths problem , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[11]  Thorsten Koch,et al.  Integer Programming Approaches to Access and Backbone IP Network Planning , 2006, HPSC.

[12]  Mikael Prytz.  On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic , 2002 .

[13]  Di Yuan,et al.  Optimization of Internet Protocol network design and routing , 2004, Networks.

[14]  John E. Hopcroft,et al.  Complexity of Computer Computations , 1974, IFIP Congress.

[15]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Yanjun Li,et al.  Inverse Matroid Intersection Problem , 1997, Math. Methods Oper. Res..

[17]  Philippe L. Toint,et al.  On the use of an inverse shortest paths algorithm for recovering linearly correlated costs , 1994, Math. Program..

[18]  J. L. Wang,et al.  Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Walid Ben-Ameur,et al.  Internet Routing and Related Topology Issues , 2003, SIAM J. Discret. Math..

[21]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[22]  P. Toint,et al.  The inverse shortest paths problem with upper bounds on shortest paths costs , 1997 .