Faster Approximate All Pairs Shortest Paths

Barna Saha, Christopher Ye

Type: Preprint

Publication Date: 2023-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2309.13225

View

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Faster Approximate All Pairs Shortest Paths	2024	Barna Saha Christopher Ye
+ PDF Chat	Fast 2-Approximate All-Pairs Shortest Paths	2024	Michal Dory Sebastian Förster Yael Kirkpatrick Yasamin Nazari Virginia Vassilevska Williams Tijn de Vos
+	Fast 2-Approximate All-Pairs Shortest Paths	2023	Michal Dory Sebastian Förster Yael Kirkpatrick Yasamin Nazari Virginia Vassilevska Williams Tijn de Vos
+	Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths	2021	Timothy M. Chan Virginia Vassilevska Williams Yinzhan Xu
+	Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time	2023	Xiao Mao
+	All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication	2000	Uri Zwick
+	Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time	2024	Xiao Bo Mao
+	Approximation Algorithms for Directed Weighted Spanners	2023	Elena Grigorescu Nithish Kumar Young‐San Lin
+	Faster all-pairs shortest paths via circuit complexity	2013	Ryan Williams
+	Faster all-pairs shortest paths via circuit complexity	2013	Ryan Williams
+	All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication	2000	Uri Zwick
+	Faster Algorithms for All Pairs Non-decreasing Paths Problem	2019	Ran Duan Ce Jin Hongxun Wu
+	Faster Algorithms for All Pairs Non-decreasing Paths Problem	2019	Ran Duan Ce Jin Hongxun Wu
+ PDF Chat	Faster All-Pairs Shortest Paths via Circuit Complexity	2018	Ryan Williams
+ PDF Chat	Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max	2019	Karl Bringmann Marvin Künnemann Karol Węgrzycki
+ PDF Chat	All pairs shortest paths using bridging sets and rectangular matrix multiplication	2002	Uri Zwick
+ PDF Chat	Faster all-pairs shortest paths via circuit complexity	2014	Ryan Williams
+	Approximation Algorithms and Hardness for $n$-Pairs Shortest Paths and All-Nodes Shortest Cycles	2022	Mina Dalirooyfard Ce Jin Virginia Vassilevska Williams Nicole Wein
+ PDF Chat	Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds	2019	Maximilian Probst Gutenberg Christian Wulff-Nilsn
+ PDF Chat	Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles	2022	Mina Dalirrooyfard Ce Jin Virginia Vassilevska Williams Nicole Wein

Cited by (0)

Action	Title	Year	Authors

Citing (0)

Action	Title	Year	Authors