7 citations · 11 across the 16 of their papers we have counts for
3 papers · 1 filter
An Experimental Study of Algorithms for Online Bipartite Matching
Allan Borodin, Christodoulos Karavasilis, Denis Pankratov
We perform an experimental study of algorithms for online bipartite matching under the known i.i.d. input model with integral types. In the last decade, there has been substantial…
Advice Complexity of Priority Algorithms
Allan Borodin, Joan Boyar, Kim S. Larsen +1
The priority model of "greedy-like" algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002. We augment this model by allowing priority algorithms to have access to advi…
Greedy Bipartite Matching in Random Type Poisson Arrival Model
Allan Borodin, Christodoulos Karavasilis, Denis Pankratov
We introduce a new random input model for bipartite matching which we call the Random Type Poisson Arrival Model. Just like in the known i.i.d. model (introduced by Feldman et al.…