Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
The Knapsack Secretary Problem is Strictly Harder Than the Secretary Problem
Eric Balkanski, Jason Chatzitheodorou, Dimitris Fotakis +1
The knapsack secretary problem is a generalization of the classical secretary problem where the accepted items must satisfy a knapsack constraint. A line of work has developed cons…
cs.DS2026
Online Min-Cost Matching with General Arrivals
Josh Ascher, Eric Balkanski, Jason Chatzitheodorou +1
In the classic online min-cost matching problem, the goal is to match a sequence of requests that arrive dynamically over time to a set of static servers, aiming to minimize the to…
cs.DS2026
On the Average-Case Performance of Greedy for Maximum Coverage
Eric Balkanski, Jason Chatzitheodorou, Flore Sentenac
For the classical maximum coverage problem, the greedy algorithm achieves a worst-case approximation, which is optimal unless . The notion of coverage…