9 citations · 15 across the 4 of their papers we have counts for
3 papers · 1 filter
Approximation Algorithms for Movement Repairmen
MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani +1
In the {\em Movement Repairmen (MR)} problem we are given a metric space along with a set of repairmen with their start depots $s_1, s_2, ...,…
Combinatorial Algorithms for Capacitated Network Design
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz +1
We focus on designing combinatorial algorithms for the Capacitated Network Design problem (Cap-SNDP). The Cap-SNDP is the problem of satisfying connectivity requirements when edges…
On Generalizations of Network Design Problems with Degree Bounds
Nikhil Bansal, Rohit Khandekar, Jochen Konemann +2
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope…