"Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case ..."

Jan van den Brand, Danupon Nanongkai (2019)

> Home

Details and statistics

DOI: 10.1109/FOCS.2019.00035

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/BrandN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BrandN19
Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. FOCS 2019: 436-455

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.