Rachit Nimavat


Semiretired Programmer, Consumed by Wanderlust, Skilled in Locating Free Food


Based onminimalbyorderedlist

Hi! I am a second year PhD student at theToyota Technological Institute at Chicago. I am currently working withProf. Julia Chuzhoy. I am interested in Theoretical Computer Science, mainly Approximation Algorithms and Hardness of Approximation.

Before that, I received my B.Tech in Computer Science and Engineering fromIndian Institute of Technology, Kanpurunder the supervision ofProf. Surender Baswana.

Currently I am writing a series ofblog postson O(log n/log log n)- approximation algorithm for the Asymmetric Traveling Salesman Problem. I plan to update it every couple of weeks.

In my free time I cook, while trying to optimize the ratio of taste over effort. I try to keep the recipes traditional (Gujarati) at heart, but cook with convenient ingredients (see therecipeof my staple dinner). When the weather is warm enough I like to read on myhammock,somewhere close to the lake-shore. Also, I am learningsailingthese days!


28 Nov: Anoteon O(log n)-approximate sparsest cut by Leighton and Rao
16 Nov:New Hardness Results for Routing on Disjoint Pathsadded on arxiv
7 Nov: A presentationon 2^{\sqrt{log n}}-approximation algorithm for a sub-case of NDP on grids