CS Assistant Professor Alexandra Kolla recently received a prestigious young faculty NSF CAREER award to better understand the limitations of approximation algorithms for solving combinatorial optimization problems. Also known as NP-hard, these types of problems are nearly impossible to solve quickly.