"New Approximation Algorithms and Reductions for n-Pairs Shortest ..."

Shiri Chechik, Itay Hoch, Gur Lifshitz (2025)

> Home

Details and statistics

DOI: 10.1137/1.9781611978322.177

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/soda/ChechikHL25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChechikHL25
Shiri Chechik, Itay Hoch, Gur Lifshitz:
New Approximation Algorithms and Reductions for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. SODA 2025: 5207-5238

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.