Skip to content

Author

S. Chechik

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#edge computing Preprint Nov 2026

Roundtrip All-Pairs Shortest Paths in Directed Graphs

This work presents a comprehensive study of roundtrip APSP and distance oracles, presenting several new lower and upper bounds, and presents a combinatorial algorithm that computes a stretch-$3 approximation to all-pairs roundtrip distances.

S. Chechik, Gur Lifshitz · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.