Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
From MaRDI portal
Publication:3593366
DOI10.1002/net.20163zbMath1121.90133MaRDI QIDQ3593366
Publication date: 20 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20163
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
90C60: Abstract computational complexity for mathematical programming problems
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Unnamed Item, Routing and Capacity Optimization for IP Networks, Intra-domain traffic engineering with shortest path routing protocols, Intra-domain traffic engineering with shortest path routing protocols, An integer programming algorithm for routing optimization in IP networks, Inverse optimization problems with multiple weight functions, Approximability of unsplittable shortest path routing problems, Optimization of OSPF Routing in IP Networks, An Integer Programming Algorithm for Routing Optimization in IP Networks
Cites Work