Complexity of inverse shortest path routing

DOI10.1007/978-3-642-21527-8_39MaRDI QIDQ3091518zbMATH OpenOpenAlexFDO

Authors Mikael Call, Kaj Holmberg

Publication date 9 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21527-8_39

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1341907
• Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
• Complexity of some inverse shortest path lengths problems
• scientific article; zbMATH DE number 1086909
• scientific article; zbMATH DE number 815126

Cited in

(4)

• Link reversal routing with binary link labels: work complexity
• Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
• A New Necessary Condition for Shortest Path Routing
• Algorithms for inverse optimization problems

This page was built for publication: Complexity of inverse shortest path routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091518)