research
∙
02/22/2023
Hitting Sets when the Shallow Cell Complexity is Small
The hitting set problem is a well-known NP-hard optimization problem in ...
share
research
∙
02/22/2023
An Interpretable Determinantal Choice Model for Subset Selection
Understanding how subsets of items are chosen from offered sets is criti...
research
∙
10/19/2022
GILP: An Interactive Tool for Visualizing the Simplex Algorithm
The Simplex algorithm for solving linear programs-one of Computing in Sc...
research
∙
11/27/2021
Scheduling Appointments Online: The Power of Deferred Decision-Making
The recently introduced online Minimum Peak Appointment Scheduling (MPAS...
research
∙
03/21/2021
Fairmandering: A column generation heuristic for fairness-optimized political districting
The American winner-take-all congressional district system empowers poli...
research
∙
12/28/2020
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
We present the first nontrivial approximation algorithm for the bottlene...
research
∙
01/16/2020