activity
20202022
most citedLocal Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs

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

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

Partially Disjoint k Shortest Paths

Yefim Dinitz, Shlomi Dolev, Manish Kumar +1

A solution of the shortest paths problem may output paths that are identical up to a single edge. On the other hand, a solution of the independent shortest paths problem co…

cs.DS2021

Polynomial Time -Shortest Multi-Criteria Prioritized and All-Criteria-Disjoint Paths

Yefim Dinitz, Shlomi Dolev, Manish Kumar

The shortest secure path (routing) problem in communication networks has to deal with multiple attack layers e.g., man-in-the-middle, eavesdropping, packet injection, packet insert…