10 citations · 39 across the 16 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023★ 1 cited
Online Bipartite Matching in the Probe-Commit Model
Allan Borodin, Calum MacRury
We consider the classical online bipartite matching problem in the probe-commit model. In this problem, when an online vertex arrives, its edges must be probed to determine if they…
cs.DS2023
Any-Order Online Interval Selection
Allan Borodin, Christodoulos Karavasilis
We consider the problem of online interval scheduling on a single machine, where intervals arrive online in an order chosen by an adversary, and the algorithm must output a set of…