Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

Alan Veliz-Cuba has received funding from the Simons Foundation and the American Mathematical Society for some of his research. You can probably think of a time when you’ve used math to solve an ...