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

Andreas Bley. Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks, 50(1):29-36, 2007. [doi]

Abstract

Abstract is missing.