Nathan Klein

Nathan Klein studies the design and analysis of approximation algorithms for NP-hard problems. He is particularly interested in understanding techniques involving randomized rounding of solutions to linear programs. At IAS, he hopes to continue studying these techniques and to begin to study the field of hardness of approximation.