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]

Authors

Andreas Bley

This author has not been identified. Look up 'Andreas Bley' in Google