10 citations · 33 across the 32 of their papers we have counts for
1 paper · 1 filter
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…