Author

Mrigankashekhar Shandilya

h-index 0 View on Semantic Scholar

We have 1 of 2 papers

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.

Preprint Jul 2026

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

A randomized algorithm is designed that runs in $\tilde{O}(n^2)$ time and, with high probability, guarantees a 2-approximation for all pairs at distance at least $c$, where $c \ge 0$ is a constant.

Manoj Gupta, Mrigankashekhar Shandilya · 0 citations