Rachit Nimavat

activity

20162023

most citedImproved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary

4 citations · 4 across the 2 of their papers we have counts for

collaborators

Showing 2016Show all

1 paper · 1 filter

cs.DS2016

New Hardness Results for Routing on Disjoint Paths

Julia Chuzhoy, David H. K. Kim, Rachit Nimavat

In the classical Node-Disjoint Paths (NDP) problem, the input consists of an undirected $n$ -vertex graph $G$ , and a collection $M = {(s_{1}, t_{1}), \dots, (s_{k}, t_{k})}$ of pairs…