$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost | Paper Citation Record

Observation 74e2ecf6-cbf8-4c9d-981a-548deb95a9de · outbound

This paper cites Journal of the ACM , volume =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Journal of the ACM , volume =

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:06.704569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2bf0b0a5-0dcb-4f59-aa7a-ce5deaa75359 · outbound

This paper cites SIAM Journal on Computing , volume =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost SIAM Journal on Computing , volume =

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:06.762339Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0fec2e60-8af1-4743-bb18-fa2ceb890dc4 · outbound

This paper cites Journal of Complexity , volume =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Journal of Complexity , volume =

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:06.865433Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4596c994-79a0-41c2-8662-12ed1bc36be6 · outbound

This paper cites Improved Additive Approximation Algorithms for.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Improved Additive Approximation Algorithms for

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:06.972754Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e407f475-5629-4fd7-b6b7-afe54fbb5465 · outbound

This paper cites Incremental Topological Sort and Cycle Detection in Expected Total Time , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Incremental Topological Sort and Cycle Detection in Expected Total Time , year =

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.075937Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67849ef6-50bf-449c-a1d5-557aab0aafe9 · outbound

This paper cites An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model , year =

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.133581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a03665c0-7ae4-42bd-a8ac-5c9de022dc0f · outbound

This paper cites Workshop on Algorithms and Data Structures , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Workshop on Algorithms and Data Structures , pages=

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.221552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7517b6e0-2bb1-416d-9266-8c919f49db23 · outbound

This paper cites 2010 , publisher=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost 2010 , publisher=

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.354632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d0c243e-3450-49d9-9b25-3187acf40f4f · outbound

This paper cites Algorithmica , volume=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Algorithmica , volume=

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.458117Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9eef5ef2-2bff-4d7e-bc14-60e133e53b7f · outbound

This paper cites Nearly 2-Approximate Distance Oracles in Subquadratic Time , booktitle =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Nearly 2-Approximate Distance Oracles in Subquadratic Time , booktitle =

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.592426Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3380146c-5901-4cfc-ba95-f2a7d5bad877 · outbound

This paper cites Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.703673Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7809fbf-91ea-4def-84e3-d4d4ed0a8ff4 · outbound

This paper cites Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I 35 , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I 35 , pages=

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.817333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 818dc335-a9ce-47d8-bca1-c5639f3ce7ae · outbound

This paper cites 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:07.969044Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6effa060-f916-41c8-a390-7650639410d9 · outbound

This paper cites SIAM Journal on Computing , volume=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost SIAM Journal on Computing , volume=

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:08.115022Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b048ed71-53bf-4923-926c-209180debc00 · outbound

This paper cites Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:08.259096Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c11f0bf4-887f-4605-9b39-4b2690f00f75 · outbound

This paper cites TheoretiCS , volume=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost TheoretiCS , volume=

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:08.416384Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 507282d8-1394-4662-b632-cf91943c50d4 · outbound

This paper cites Journal of computer and system sciences , volume=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Journal of computer and system sciences , volume=

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:08.561579Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e7ded90-fc02-4374-9f09-45e8c38aab15 · outbound

This paper cites Journal of Algorithms , volume=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Journal of Algorithms , volume=

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:08.758650Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d81c694-f4ec-459c-b4e2-65de02622810 · outbound

This paper cites All-pairs nearly 2-approximate shortest paths in.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost All-pairs nearly 2-approximate shortest paths in

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:08.859554Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation abe2ab1f-3897-46ae-af9f-38b6856051f9 · outbound

This paper cites 43rd International Colloquium on Automata, Languages, and Programming,.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost 43rd International Colloquium on Automata, Languages, and Programming,

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.025702Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd1e2cb5-4666-4dd4-a0f4-b8b876d8dfac · outbound

This paper cites Negative-Weight Single-Source Shortest Paths in Near-linear Time.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Negative-Weight Single-Source Shortest Paths in Near-linear Time

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.161187Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d5e3bcba-fb17-450b-812a-0335f8aad99b · outbound

This paper cites A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths , year =

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.279621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d2c800af-ac5e-4463-9cf0-af2a79a63a38 · outbound

This paper cites Dynamic Set Cover: Improved Amortized and Worst-Case Update Time , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Dynamic Set Cover: Improved Amortized and Worst-Case Update Time , year =

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.383866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c98bb5e-7c9c-4e53-800e-ed628b79846b · outbound

This paper cites Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs , year =

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.537462Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1284a07-5d33-4fb8-81bd-33ef30266cc6 · outbound

This paper cites Information Processing Letters , volume=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Information Processing Letters , volume=

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.634959Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f237dbd4-46cf-4332-8610-864d75af06b6 · outbound

This paper cites Fast 2-Approximate All-Pairs Shortest Paths , booktitle =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Fast 2-Approximate All-Pairs Shortest Paths , booktitle =

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.759802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1625969a-af24-44b8-9688-34bf988d5fd5 · outbound

This paper cites New Algorithms for All Pairs Approximate Shortest Paths , booktitle =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost New Algorithms for All Pairs Approximate Shortest Paths , booktitle =

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:09.900772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 101bf5f1-18ea-4aee-a6af-6d8acbe0ca8b · outbound

This paper cites Faster Approximate All Pairs Shortest Paths , booktitle =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Faster Approximate All Pairs Shortest Paths , booktitle =

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.034935Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89d7277d-341a-4ea4-86ff-f408753ef2c4 · outbound

This paper cites 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , year=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , year=

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.152320Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 751ecca4-5465-4f6e-a21b-ec6a4aaa8840 · outbound

This paper cites SIAM Journal on Computing , volume=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost SIAM Journal on Computing , volume=

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.291120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21179dfb-43a5-4172-850b-6c19d8b12aed · outbound

This paper cites Distributed weighted min-cut in nearly-optimal time , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Distributed weighted min-cut in nearly-optimal time , year =

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.452230Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a06de212-1a45-490b-9de8-3cb72358db44 · outbound

This paper cites Vertex connectivity in poly-logarithmic max-flows , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Vertex connectivity in poly-logarithmic max-flows , year =

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.548819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ced37d5-5e69-4224-ad4f-1d8d5cb2a639 · outbound

This paper cites A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , year =

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.646490Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63d15072-a1ad-40d1-a7ed-9dbb8fe1ab0b · outbound

This paper cites Weighted min-cut: sequential, cut-query, and streaming algorithms , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Weighted min-cut: sequential, cut-query, and streaming algorithms , year =

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.764347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 555a86f5-7851-4612-840e-7939a194f6b7 · outbound

This paper cites Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.888950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ff5d00b-4799-404a-836e-507bec21c984 · outbound

This paper cites Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time , year =

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:10.990375Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 880d2833-ed1a-41e8-95ae-4a8cc467611d · outbound

This paper cites Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , year =

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:11.125696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f6fa0562-ef6e-49a7-bf22-733b28dd944d · outbound

This paper cites Distributed exact weighted all-pairs shortest paths in near-linear time , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Distributed exact weighted all-pairs shortest paths in near-linear time , year =

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:11.200774Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e927be1e-19a2-4acf-9fec-d1dd6e62c112 · outbound

This paper cites Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , year =

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:11.361935Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e376f59d-b0c6-4e1d-b77e-cf1f788baf6d · outbound

This paper cites A Faster Distributed Single-Source Shortest Paths Algorithm , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost A Faster Distributed Single-Source Shortest Paths Algorithm , year =

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:11.503906Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53be401c-3df3-4d0e-bf1a-8f902321b6df · outbound

This paper cites Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks , year =

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:11.593577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1758d8ef-8f45-4880-a3b3-bf901c166653 · outbound

This paper cites Distributed Exact Weighted All-Pairs Shortest Paths in.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Distributed Exact Weighted All-Pairs Shortest Paths in

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:11.725092Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 757e110e-18e2-4eca-a2c7-8dced5c968b6 · outbound

This paper cites Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , year =

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:11.863160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed2a2095-9f13-4d2a-b90b-4f211dc2947d · outbound

This paper cites Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n\(.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n\(

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.063693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98348b7b-ec72-428e-a394-9fa6b1cb66e4 · outbound

This paper cites Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , year =

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.157772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8bf83f5-dbe6-4313-ab75-cf970785ad0d · outbound

This paper cites New deterministic approximation algorithms for fully dynamic matching , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost New deterministic approximation algorithms for fully dynamic matching , year =

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.257521Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a906603b-fd21-4928-87fe-24bc1fc67013 · outbound

This paper cites Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs , year =

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.419771Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eae0997b-619d-466a-bb05-f07d4f5a7455 · outbound

This paper cites Tsourakakis , booktitle =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Tsourakakis , booktitle =

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.522621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2e08406-b037-4819-b333-0bf67a86653a · outbound

This paper cites Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , year =

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.616083Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23daf8e7-c4cb-4389-93c6-9a528fddca7d · outbound

This paper cites Faster Algorithms for Semi-Matching Problems , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Faster Algorithms for Semi-Matching Problems , year =

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.738092Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59823fc9-c42d-4e85-bccf-508cbef74592 · outbound

This paper cites Almost-Tight Distributed Minimum Cut Algorithms , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Almost-Tight Distributed Minimum Cut Algorithms , year =

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.890618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54909a9a-0558-421d-b2f2-9fe7b8ede131 · outbound

This paper cites 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:12.995135Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba22bca5-9478-4181-8ccb-7756bda52feb · outbound

This paper cites Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:13.159206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 367e8a00-d53f-4459-9327-af15e1ace597 · outbound

This paper cites Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:13.294826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 054e9e88-2172-4594-b7a3-ed0dcd2e3016 · outbound

This paper cites Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:13.399191Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac0c80fd-7ec4-49ea-a207-63dc2b1e8323 · outbound

This paper cites Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:13.499312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c7c233d-a855-49d1-a803-157ddc2acaf3 · outbound

This paper cites Additive Spanners and Distance Oracles in Quadratic Time.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Additive Spanners and Distance Oracles in Quadratic Time

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:13.638257Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a567530-6275-4e1f-8870-cdefca57fca3 · outbound

This paper cites Theory Comput.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Theory Comput

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:13.874915Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 065d36d1-374a-4f8a-b821-36966a6a3b39 · outbound

This paper cites Weighted dynamic finger in binary search trees , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Weighted dynamic finger in binary search trees , year =

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:13.966597Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5626e898-55c2-4801-a27a-9c556e83a979 · outbound

This paper cites 42nd Annual Symposium on Foundations of Computer Science,.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost 42nd Annual Symposium on Foundations of Computer Science,

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.105367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0763d651-1b3a-4d2b-a449-0b256795726f · outbound

This paper cites Distributed Computing - 28th International Symposium,.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Distributed Computing - 28th International Symposium,

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.179175Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f2ab3b2-ca3c-44a9-bc6e-28f3ed7a593a · outbound

This paper cites Upper bounds for time-space trade-offs in sorting and selection , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Upper bounds for time-space trade-offs in sorting and selection , year =

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.280201Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97c9daf7-ea63-4148-a15f-a0db222255dd · outbound

This paper cites Upper Bounds for Maximally Greedy Binary Search Trees , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Upper Bounds for Maximally Greedy Binary Search Trees , year =

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.382407Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33d47ade-c845-4928-bb26-e05a5b66bd7a · outbound

This paper cites Lawrence and Wegman, Mark N.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Lawrence and Wegman, Mark N

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.535672Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60e3b245-1177-4e7b-bbd1-1abe2145c54f · outbound

This paper cites Truthful unit-demand auctions with budgets revisited , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Truthful unit-demand auctions with budgets revisited , year =

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.607241Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4316fdfe-3110-4a5c-813c-1aecd22c8e19 · outbound

This paper cites Towards polynomial lower bounds for dynamic problems , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Towards polynomial lower bounds for dynamic problems , year =

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.702492Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8b145df-d7b7-4f6b-99a1-1965a46e076d · outbound

This paper cites The State of the Art in Dynamic Graph Algorithms , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost The State of the Art in Dynamic Graph Algorithms , year =

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.822582Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18844658-d839-4d8e-bc47-c829914e0358 · outbound

This paper cites The Power of Vertex Sparsifiers in Dynamic Graph Algorithms , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost The Power of Vertex Sparsifiers in Dynamic Graph Algorithms , year =

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:14.955235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06540552-f22b-4b85-a52d-0ca1c125d38e · outbound

This paper cites The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree , year =

Reference 70

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.067691Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd1964cd-51d1-425b-9013-0623106e3583 · outbound

This paper cites The power of deferral: maintaining a constant-competitive steiner tree online , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost The power of deferral: maintaining a constant-competitive steiner tree online , year =

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.201929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0400709-a973-47a7-bc72-ef4937a44943 · outbound

This paper cites Bender and Martin Farach.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Bender and Martin Farach

Reference 72

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.337362Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6db521e8-b183-457c-bd1d-4c944df06f8b · outbound

This paper cites The k most vital arcs in the shortest path problem , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost The k most vital arcs in the shortest path problem , year =

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.494297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fb2a2d8-e9ea-441f-b790-9e9942d1fc7e · outbound

This paper cites The discrepancy method - randomness and complexity , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost The discrepancy method - randomness and complexity , year =

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.621178Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da0362d1-da31-45e0-b369-6b1e80702b1f · outbound

This paper cites and Hopcroft, John E.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost and Hopcroft, John E

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.712570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70b2ae84-0a11-48d0-b81d-f688cc54f32f · outbound

This paper cites Symbolic algorithms for qualitative analysis of Markov decision processes with B.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Symbolic algorithms for qualitative analysis of Markov decision processes with B

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.826121Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f17c8ed4-1350-4bc7-add3-6e6ecca98b7d · outbound

This paper cites Subquadratic dynamic path reporting in directed graphs against an adaptive adversary , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Subquadratic dynamic path reporting in directed graphs against an adaptive adversary , year =

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:15.928544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f9f0215-c3dc-42f1-91b7-c534bd20dc0d · outbound

This paper cites Ryan , journal =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Ryan , journal =

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:16.130381Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2fdc843-59e5-45dd-8e76-ca1534e5a663 · outbound

This paper cites Italiano and Amnon Nissenzweig , journal =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Italiano and Amnon Nissenzweig , journal =

Reference 79

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:16.298814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3f1f996-c411-4efb-8334-bf8c01e3bfc4 · outbound

This paper cites Sparse Fault-Tolerant.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Sparse Fault-Tolerant

Reference 80

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:16.492167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 995dfdc5-baf3-4b8f-97a7-cb6241cdddc2 · outbound

This paper cites Space--time trade-offs for stack-based algorithms , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Space--time trade-offs for stack-based algorithms , year =

Reference 81

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:16.665588Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc5acf56-d279-4c5e-85d6-b964893265c3 · outbound

This paper cites Simultaneously Load Balancing for Every p-norm, With Reassignments , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Simultaneously Load Balancing for Every p-norm, With Reassignments , year =

Reference 82

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:16.807372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e662a2f0-7106-4d5c-b55f-528473e4258d · outbound

This paper cites Simple deterministic algorithms for fully dynamic maximal matching , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Simple deterministic algorithms for fully dynamic maximal matching , year =

Reference 83

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:16.940882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3af56c7f-eefb-4b3e-9a5b-9a057eca7924 · outbound

This paper cites Shortest paths in directed planar graphs with negative lengths: A linear-space O (n log 2 n)-time algorithm , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Shortest paths in directed planar graphs with negative lengths: A linear-space O (n log 2 n)-time algorithm , year =

Reference 84

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:17.054942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc4e7ea1-c959-439a-b75e-58231b34256c · outbound

This paper cites Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form , year =

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:17.271519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b3f4a34-8624-4d16-b36a-2810fbb192f2 · outbound

This paper cites Sensitive Distance and Reachability Oracles for Large Batch Updates , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Sensitive Distance and Reachability Oracles for Large Batch Updates , year =

Reference 86

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:17.421834Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77f80dc5-bd4b-4130-a023-2cfcbe806d10 · outbound

This paper cites Self-Adjusting Binary Search Trees , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Self-Adjusting Binary Search Trees , year =

Reference 87

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:17.574944Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 95d384a9-b867-4229-a099-734155bae4cc · outbound

This paper cites Scaling algorithms for approximate and exact maximum weight matching , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Scaling algorithms for approximate and exact maximum weight matching , year =

Reference 88

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:17.743493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19267090-4fd1-4a4e-91a6-e930d029d3ea · outbound

This paper cites Distributed Computing , title =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Distributed Computing , title =

Reference 89

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:17.882675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46b63f95-349b-46b9-824f-f63d19560bea · outbound

This paper cites Replacement paths via fast matrix multiplication , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Replacement paths via fast matrix multiplication , year =

Reference 90

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.105228Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 62631679-27e5-4d51-a16d-63f03414868d · outbound

This paper cites Replacement paths and k simple shortest paths in unweighted directed graphs , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Replacement paths and k simple shortest paths in unweighted directed graphs , year =

Reference 91

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.213347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2231d3ee-5788-4844-9926-47da18c8ea18 · outbound

This paper cites Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication , year =

Reference 92

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.331113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9d65fdb-2fbb-4f5b-8c2f-e4833e829c21 · outbound

This paper cites Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation , year =

Reference 93

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.463883Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5af02466-781a-4048-b590-2970e19e086d · outbound

This paper cites Preserving Distances in Very Faulty Graphs , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Preserving Distances in Very Faulty Graphs , year =

Reference 94

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.566975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82c400a6-f5c0-4e54-8f4c-2a4d9e531ce6 · outbound

This paper cites Practical Minimum Cut Algorithms , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Practical Minimum Cut Algorithms , year =

Reference 95

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.620409Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48289df8-f220-4082-8901-5e479d3e3b93 · outbound

This paper cites Powers of tensors and fast matrix multiplication , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Powers of tensors and fast matrix multiplication , year =

Reference 96

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.794464Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4860395a-dbe5-419a-9d96-da9b4332403f · outbound

This paper cites Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , year =

Reference 97

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:18.927366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16505003-5563-4db3-b8ed-a071e92ab625 · outbound

This paper cites Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , year =

Reference 98

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:19.029376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c5539bb-3f20-42b8-b803-476bb972b0f1 · outbound

This paper cites Edmonds , journal =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Edmonds , journal =

Reference 99

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:19.104034Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80fd35d9-1a0c-431e-aaed-d599e8596688 · outbound

This paper cites Oracles for Distances Avoiding a Failed Node or Link , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Oracles for Distances Avoiding a Failed Node or Link , year =

Reference 100

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:19.207232Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7ba5a6f-dc62-4374-887c-1bbfe2fa588c · outbound

This paper cites On the k-simple shortest paths problem in weighted directed graphs , year =.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost On the k-simple shortest paths problem in weighted directed graphs , year =

Reference 101

Resolution: unresolved; no resolver link, observed 2026-08-01T14:44:19.320528Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers