50 citations · 61 across the 5 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 50 cited
Online Algorithms with Advice for Bin Packing and Scheduling Problems
Marc P. Renault, Adi Rosén, Rob van Stee
We consider the setting of online computation with advice, and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these prob…
cs.DS2013★ 9 cited
Approximating Semi-Matchings in Streaming and in Two-Party Communication
Christian Konrad, Adi Rosén
We study the communication complexity and streaming complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E), with n = |A|, is a su…