Vikrant Ashvinkumar

activity

20242026

collaborators

Showing 2024 · cs.DSShow all

2 papers · 2 filters

cs.DS2024

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs

Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz

In the restricted shortest paths problem, we are given a graph $G$ whose edges are assigned two non-negative weights: lengths and delays, a source $s$ , and a delay threshold $D$ . T…

cs.DS2024

Low Sensitivity Hopsets

Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng +2

Given a weighted graph $G$ , a $(I^^{2}, ε)$ -hopset $H$ is an edge set such that for any $s, t \in V (G)$ , where $s$ can reach $t$ in $G$ , there is a path from $s$ to $t$ in $G \…