Mrigankashekhar Shandilya
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Algorithms×1
Frequent co-authors
Research Timeline
2026
$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost
This paper presents a randomized algorithm that runs in $ ilde{O}(n^2)$ time and, with high probability, guarantees a 2-approximation for all pairs at distance at least $c$ in an undirected, unweighted graph.
Highlighted terms show continued research focus across papers