Jaikumar Radhakrishnan
Tata Institute of Fundamental Research
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Jaikumar Radhakrishnan.
Algorithmica | 1997
Magnús M. Halldórsson; Jaikumar Radhakrishnan
AbstractTheminimum-degree greedy algorithm, or Greedy for short, is a simple and well-studied method for finding independent sets in graphs. We show that it achieves a performance ratio of (Δ+2)/3 for approximating independent sets in graphs with degree bounded by Δ. The analysis yields a precise characterization of the size of the independent sets found by the algorithm as a function of the independence number, as well as a generalization of Turán’s bound. We also analyze the algorithm when run in combination with a known preprocessing technique, and obtain an improved
SIAM Journal on Discrete Mathematics | 2000
Jaikumar Radhakrishnan; Amnon Ta-Shma
Archive | 2004
Paritosh K. Pandya; M. Agrawal; Jaikumar Radhakrishnan
(2\bar d + 3)/5
symposium on the theory of computing | 1994
Magnús M. Halldórsson; Jaikumar Radhakrishnan
ACM Transactions on Information and System Security | 2008
Roberto Di Pietro; Luigi V. Mancini; Alessandro Mei; Alessandro Panconesi; Jaikumar Radhakrishnan
performance ratio on graphs with average degree
security of ad hoc and sensor networks | 2004
Roberto Di Pietro; Luigi V. Mancini; Alessandro Mei; Alessandro Panconesi; Jaikumar Radhakrishnan
foundations of computer science | 1997
Jaikumar Radhakrishnan; Amnon Ta-Shma
\bar d
conference on computational complexity | 2007
Prahladh Harsha; Rahul Jain; David A. McAllester; Jaikumar Radhakrishnan
conference on computational complexity | 2005
Rahul Jain; Jaikumar Radhakrishnan; Pranab Sen
, improving on the previous best
conference on computational complexity | 2002
Amit Deshpande; Rahul Jain; Telikepalli Kavitha; Satyanarayana V. Lokam; Jaikumar Radhakrishnan
