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 …

In the online bipartite matching problem with replacements, all the vertices on one side of
the bipartition are given, and the vertices on the other side arrive one-by-one with all their …

We study the consistent k-center clustering problem. In this problem, the goal is to maintain a
constant factor approximate k-center solution during a sequence of n point insertions and …

Consider the following edge-orientation problem: edges of a graph appear online one-by-
one and they to be directed—given an “orientation”. We want to ensure that the in-degree of …

This paper is motivated by the fact that many systems need to be maintained continually
while the underlying costs change over time. The challenge is to continually maintain near …

In the online Steiner tree problem, a sequence of points is revealed one-by-one: when a
point arrives, we only have time to add a single edge connecting this point to the previous …

In the single-resource dynamic fair division framework there is a homogeneous resource
that is shared between agents dynamically arriving and departing over time. When n agents …

Given points from an arbitrary metric space and a sequence of point updates sent by an
adversary, what is the minimum recourse per update (ie, the minimum number of changes …

Given a stream of points in a metric space, is it possible to maintain a constant approximate
clustering by changing the cluster centers only a small number of times during the entire …

Scheduling a set of n jobs on m identical parallel machines so as to minimize the makespan
or maximize the minimum machine load are two of the most important and fundamental …