3 citations · 8 across the 14 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 1 cited
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
Allan Borodin, Denis Pankratov, Amirali Salehi-Abari
Recently, Renault (2016) studied the dual bin packing problem in the per-request advice model of online algorithms. He showed that given advice bits for each input item al…
cs.DS2017
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
Allan Borodin, Denis Pankratov, Amirali Salehi-Abari
We present a series of results regarding conceptually simple algorithms for bipartite matching in various online and related models. We first consider a deterministic adversarial m…