External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Almost Shortest Paths with Near-Additive Error in Weighted Graphs

Michael Elkin, Yuval Gitlitz, Ofer Neiman. Almost Shortest Paths with Near-Additive Error in Weighted Graphs. In Artur Czumaj, Qin Xin 0001, editors, 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands. Volume 227 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Authors

Michael Elkin

This author has not been identified. Look up 'Michael Elkin' in Google

Yuval Gitlitz

This author has not been identified. Look up 'Yuval Gitlitz' in Google

Ofer Neiman

This author has not been identified. Look up 'Ofer Neiman' in Google
runs on