"Hyperbolic Embeddings for Near-Optimal Greedy Routing."

Thomas Bläsius et al. (2020)

> Home

Details and statistics

DOI: 10.1145/3381751

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/Blasius0KK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/Blasius0KK20
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics 25: 1-18 (2020)

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.