Approximation algorithms and hardness proofs characterize the best approximation guarantees achievable in polynomial time for fundamental optimization problems. My research investigates these frontiers across network design, social choice theory, and satisfiability. Specifically, I explore approximation guarantees for variations of the Steiner Tree problem, analyze election outcomes under preference information, and develop techniques for generating hard instances to benchmark SAT solvers.
Iman Gholami is a third-year Ph.D. student under the supervision of Prof. MohammadTaghi Hajiaghayi. His research focuses on the design and analysis of algorithms, specifically approximation algorithms for variants of graph and combinatorial optimization problems.