1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.GT2023
Bounding the Price-of-Fair-Sharing using Knapsack-Cover Constraints to guide Near-Optimal Cost-Recovery Algorithms
Sander Aarts, Jacob Dentes, Manxi Wu +1
We consider the problem of fairly allocating the cost of providing a service among a set of users, where the service cost is formulated by an NP-hard {\it covering integer program…
cs.LG2023★ 1 cited
An Interpretable Determinantal Choice Model for Subset Selection
Sander Aarts, David B. Shmoys, Alex Coy
Understanding how subsets of items are chosen from offered sets is critical to assortment planning, wireless network planning, and many other applications. There are two seemingly…
cs.CG2023
Hitting Sets when the Shallow Cell Complexity is Small
Sander Aarts, David B. Shmoys
The hitting set problem is a well-known NP-hard optimization problem in which, given a set of elements and a collection of subsets, the goal is to find the smallest selection of el…