Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
From MaRDI portal
Publication:3593366
DOI10.1002/net.20163zbMath1121.90133OpenAlexW4242097656MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Unnamed Item, An Integer Programming Algorithm for Routing Optimization in IP Networks, Routing and Capacity Optimization for IP Networks, Intra-domain traffic engineering with shortest path routing protocols, An integer programming algorithm for routing optimization in IP networks, Intra-domain traffic engineering with shortest path routing protocols, Approximability of unsplittable shortest path routing problems, Optimization of OSPF Routing in IP Networks, Inverse optimization problems with multiple weight functions
Cites Work