On the public citation graph

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

https://doi.org/10.1002/net.20163

0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/dac.551openalex-snapshot

Multi‐hour design of survivable classical IP networks

inferredcites →https://doi.org/10.1002/net.10048openalex-snapshot

Combinatorial algorithms for inverse network flow problems

inferredcites →https://doi.org/10.1002/net.10102openalex-snapshot

Optimization of Internet Protocol network design and routing

inferredcites →https://doi.org/10.1002/net.20070openalex-snapshot

A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing

inferredcites →https://doi.org/10.1002/net.3230120406openalex-snapshot

An efficient algorithm for K shortest simple paths

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot

Reducibility among Combinatorial Problems

inferredcites →https://doi.org/10.1007/978-3-642-59179-2_8openalex-snapshot

The inverse shortest paths problem with upper bounds on shortest paths costs

inferredcites →https://doi.org/10.1007/bf01193863openalex-snapshot

Inverse Matroid Intersection Problem

inferredcites →https://doi.org/10.1007/bf01582056openalex-snapshot

On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

inferredcites →https://doi.org/10.1007/bf01585693openalex-snapshot

On an instance of the inverse shortest paths problem

inferredcites →https://doi.org/10.1007/bf03167381openalex-snapshot

An inverse problem of the weighted shortest path problem

inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot

Optimization, approximation, and complexity classes

inferredcites →https://doi.org/10.1016/0377-0427(95)00277-4openalex-snapshot

Calculating some inverse linear programming problems

inferredcites →https://doi.org/10.1016/s0166-218x(02)00235-4openalex-snapshot

Inverse optimization in high-speed networks

inferredcites →https://doi.org/10.1023/a:1014852026591openalex-snapshot

A Genetic Algorithm for the Weight Setting Problem in OSPF Routing

inferredcites →https://doi.org/10.1023/b:coap.0000039487.35027.02openalex-snapshot

Increasing Internet Capacity Using Local Search

inferredcites →https://doi.org/10.1090/dimacs/049/06openalex-snapshot

The complexity of an inverse shortest paths problem

inferredcites →https://doi.org/10.1109/icnn.1994.375018openalex-snapshot

An embedded connectionist approach for the inverse shortest paths problem

inferredcites →https://doi.org/10.1109/infcom.2000.832225openalex-snapshot

Internet traffic engineering by optimizing OSPF weights

inferredcites →https://doi.org/10.1137/s0895480100377428openalex-snapshot

Internet Routing and Related Topology Issues

inferredcites →https://doi.org/10.1287/opre.49.5.771.10607openalex-snapshot

Inverse Optimization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20160openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1002/net.20303openalex-snapshot

Approximability of unsplittable shortest path routing problems

inferred← citeshttps://doi.org/10.1002/net.21612openalex-snapshot

On the complexity of equal shortest path routing

inferred← citeshttps://doi.org/10.1002/net.21792openalex-snapshot

Open shortest path first routing under random early detection

inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot

Routing and Capacity Optimization for IP Networks

inferred← citeshttps://doi.org/10.1007/978-3-540-79409-7_7openalex-snapshot

Integer Programming Approaches to Access and Backbone IP Network Planning

inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_17openalex-snapshot

An Integer Programming Algorithm for Routing Optimization in IP Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_8openalex-snapshot

Optimization of OSPF Routing in IP Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_39openalex-snapshot

Complexity of Inverse Shortest Path Routing

inferred← citeshttps://doi.org/10.1007/s00186-026-00924-8openalex-snapshot

A combinatorial algorithm for inverse continuous quadratic knapsack problem

inferred← citeshttps://doi.org/10.1007/s00453-009-9381-5openalex-snapshot

An Integer Programming Algorithm for Routing Optimization in IP Networks

inferred← citeshttps://doi.org/10.1007/s10288-009-0113-0openalex-snapshot

Intra-domain traffic engineering with shortest path routing protocols

inferred← citeshttps://doi.org/10.1007/s10479-012-1270-7openalex-snapshot

Intra-domain traffic engineering with shortest path routing protocols

inferred← citeshttps://doi.org/10.1016/j.dam.2022.12.004openalex-snapshot

Inverse optimization problems with multiple weight functions

inferred← citeshttps://doi.org/10.1057/s41274-016-0144-9openalex-snapshot

An origin-based model for unique shortest path routing

inferred← citeshttps://doi.org/10.1080/23249935.2026.2635567openalex-snapshot

Unveiling implicit path outlier deviations via foundational linear inverse optimization in mobility networks

inferred← citeshttps://doi.org/10.1109/icnp55882.2022.9940325openalex-snapshot

On the Complexity of Network-Wide Configuration Synthesis

inferred← citeshttps://doi.org/10.1109/jsyst.2015.2433671openalex-snapshot

A Multiobjective Wavelength Routing Approach Combining Network and Traffic Engineering With Energy Awareness

inferred← citeshttps://doi.org/10.1109/tnet.2015.2411056openalex-snapshot

Embedding IP Unique Shortest Path Topology on a Wavelength-Routed Network: Normal and Survivable Design

inferred← citeshttps://doi.org/10.1139/x2012-063openalex-snapshot

Route selection for best distances in road databases based on drivers’ and customers’ preferences

inferred← citeshttps://doi.org/10.1287/inte.2017.0906openalex-snapshot

Calibrated Route Finder: Improving the Safety, Environmental Consciousness, and Cost Effectiveness of Truck Routing in Sweden

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.