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

Bringmann, Karl; Cassis, Alejandro; Fischer, Nick

doi:10.1109/FOCS57990.2023.00038

Lokale TagsFreigabegeschichteDetailsÜbersicht

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

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.

Item is Freigegeben

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:

Datensatz-Permalink: https://hdl.handle.net/21.11116/0000-000E-7585-8 Versions-Permalink: https://hdl.handle.net/21.11116/0000-000E-758D-0

Genre: Konferenzbeitrag

Latex : Negative-Weight Single-Source Shortest Paths in Near-Linear Time: {N}ow Faster!

Dateien

einblenden: Dateien

ausblenden: Dateien

:

2304.05279.pdf (Preprint), 968KB

Öffnen Speichern

Datei-Permalink:
https://hdl.handle.net/21.11116/0000-000E-758B-2

Name:
2304.05279.pdf

Beschreibung:
Full version of the paper

OA-Status:
Keine Angabe

Sichtbarkeit:
Öffentlich

MIME-Typ / Prüfsumme:
application/pdf / [MD5]

Technische Metadaten:

Öffnen

Copyright Datum:
-

Copyright Info:
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Lizenz:
-