Coordinating a small group of friends for dinner can be challenging enough. Imagine building a schedule for thousands of students. For Paige Stanley, a Johns Hopkins University senior, the difficulty ...

In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...

When it comes to teaching math, a debate has persisted for decades: How, and to what degree, should algorithms be a focus of learning math? The step-by-step procedures are among the most debated ...