"Approximation Algorithms and Hardness for n-Pairs Shortest Paths and ..."

Mina Dalirrooyfard et al. (2022)

> Home

Details and statistics

DOI: 10.1109/FOCS54457.2022.00034

access: closed

type: Conference or Workshop Paper

metadata version: 2023-07-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/DalirrooyfardJW22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/DalirrooyfardJW22
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS 2022: 290-300

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.