"Computing almost shortest paths."

Michael Elkin (2005)

> Home

Details and statistics

DOI: 10.1145/1103963.1103968

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/Elkin05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/Elkin05
Michael Elkin:
Computing almost shortest paths. ACM Trans. Algorithms 1(2): 283-323 (2005)

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.