"Inapproximability results for the inverse shortest paths problem with ..."

Andreas Bley (2007)

> Home

Details and statistics

DOI: 10.1002/NET.20163

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Bley07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Bley07
Andreas Bley:
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks 50(1): 29-36 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.