We explore the problem of assigning heterogeneous tasks to workers with different,
unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first …

The primal–dual method is a powerful algorithmic technique that has proved to be extremely
useful for a wide variety of problems in the area of approximation algorithms for NP-hard …

Crowdsourcing markets have gained popularity as a tool for inexpensively collecting data
from diverse populations of workers. Classification tasks, in which workers provide labels …

This paper studies online algorithms augmented with multiple machine-learned predictions.
We give a generic algorithmic framework for online covering problems with multiple …

Hierarchical graph decompositions play an important role in the design of approximation
and online algorithms for graph problems. This is mainly due to the fact that the results …

Let X=[1, 2,•••, n] be a ground set of n elements, and let S be a family of subsets of X,| S|= m,
with a positive cost cS associated with each S∈ S. Consider the following online version of …

We study a wide range of online covering and packing optimization problems. In an online
covering problem, a linear cost function is known in advance, but the linear constraints that …

In this paper, we give new results for the set cover problem in the fully dynamic model. In this
model, the set of" active" elements to be covered changes over time. The goal is to maintain …

The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …

The Steiner tree problem is one of the most important combinatorial optimization problems. It
has a long history that can be traced back to the famous mathematician Fermat (1601-1665) …