Bewegte Bilder
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
- Standort
-
Hannover TIB
- Umfang
-
233MB, 00:14:28:16 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
ACM WSDM 2025 - The 18th ACM International Conference on Web Search and Data Mining ; (Jan. 2025)
- Ereignis
-
Veröffentlichung
- (wer)
-
Leibniz Universität Hannover (LUH), L3S Research Center, Technische Informationsbibliothek (TIB)
- (wann)
-
2025-01-01
- Beteiligte Personen und Organisationen
-
Basu, Sabyasachi
Köshima, Nadia
Eden, Talya
Eliezer, Omri Ben
Seshadhri, C.
- DOI
-
10.5446/70192
- Letzte Aktualisierung
- 21.04.2026, 10:49 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB).
Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Basu, Sabyasachi
- Köshima, Nadia
- Eden, Talya
- Eliezer, Omri Ben
- Seshadhri, C.
- Leibniz Universität Hannover (LUH), L3S Research Center, Technische Informationsbibliothek (TIB)
Entstanden
- 2025-01-01
Ähnliche Objekte (12)
Fast approximate shortest paths in the congested clique
Encoding Shortest Paths in Spatial Networks
Shortest Paths II
Shortest Paths II
Universal Shortest Paths
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Simulating SIR processes on networks using weighted shortest paths
Shortest Paths III / Network Flows
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Timetable information and shortest paths
Fast approximate shortest paths in the congested clique
Encoding Shortest Paths in Spatial Networks
Shortest Paths II
Shortest Paths II
Universal Shortest Paths
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Simulating SIR processes on networks using weighted shortest paths
Shortest Paths III / Network Flows
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Timetable information and shortest paths
Fast approximate shortest paths in the congested clique
Encoding Shortest Paths in Spatial Networks
Shortest Paths II
Shortest Paths II
Universal Shortest Paths
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Simulating SIR processes on networks using weighted shortest paths
Shortest Paths III / Network Flows
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments