11 citations · 32 across the 20 of their papers we have counts for
4 papers · 1 filter
Edge covering with budget constrains
Rajiv Gandhi, G. Kortsarz
We study two related problems: finding a set of k vertices and minimum number of edges (kmin) and finding a graph with at least m' edges and minimum number of vertices (mvms). Gold…
Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT
Mohammad T. Hajiaghayi, Rohit Khandekar, Guy Kortsarz
In this paper, we consider proving inapproximability in terms of OPT and thus we base the foundations of fixed parameter inapproximability.
Fixed-Parameter and Approximation Algorithms: A New Look
Rajesh Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz
A Fixed-Parameter Tractable (\FPT) -approximation algorithm for a minimization (resp. maximization) parameterized problem is an FPT algorithm that, given an instance $(x, k)…
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, ...,…