We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges.Expand

We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-?)-approximated in polynomial time.Expand

We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard.Expand

We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs in which the edge capacities can vary arbitrarily over the graph.Expand

We introduce a new notion of informational complexity which is related to SM complexity and has nice direct sum properties in the simultaneous message (SM) model.Expand

The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi to initiate a formal study of the communication cost of certain fundamental problems arising in distributed systems.Expand