"Hopsets with Constant Hopbound, and Applications to Approximate Shortest ..."

Michael Elkin, Ofer Neiman (2019)

> Home

Details and statistics

DOI: 10.1137/18M1166791

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ElkinN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ElkinN19
Michael Elkin, Ofer Neiman:
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. SIAM J. Comput. 48(4): 1436-1480 (2019)

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.