Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory li...
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
This paper describes some issues concerning assessment and the corresponding motivation for students to work in a desired manner. The issues came from studying assessment in the R...
Mats Daniels, Anders Berglund, Arnold Neville Pear...
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...