Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

Bringmann, Karl; Cassis, Alejandro; Fischer, Nick

doi:10.1109/FOCS57990.2023.00038

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons263580

Cassis, Alejandro
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

2304.05279.pdf
(Preprint), 968KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., Cassis, A., & Fischer, N. (2023). Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! In IEEE 64th Annual Symposium on Foundations of Computer Science (pp. 515-538). Piscataway, NJ: IEEE.

Cite as: https://hdl.handle.net/21.11116/0000-000E-7585-8

Abstract

There is no abstract available