1. Linear Programming based Reductions for Multiple Visit TSP and Vehicle Routing Problems Submitted
2. An Improved Approximation for the Max-3-Section Problem, In Proceedings of European Symposium of Algorithms, ESA 2023
3. Analyzing Residual Random Greedy for monotone submodular maximization, In Information Processing Letters 2023

I’m a fourth year PhD student in the Algorithms, Combinatorics, & Optimization (ACO) program at Georgia Tech working with Mohit Singh. I did my undergrad at University of Illinois at Urbana-Champaign in Math and Computer Science.

I am interested in combinatorial optimization and work specifically on approximation algorithms. My current research includes work on the following three problems (1) Traveling Salesman Problem (2) Max Cut (3) D-Optimal Design.