Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
There are many database applications that require users to coordinate and communicate. Friends want to coordinate travel plans, students want to jointly enroll in the same set of ...
Lucja Kot, Nitin Gupta 0003, Sudip Roy, Johannes G...
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-...
Melanie Nicole Zeilinger, Colin Neil Jones, Davide...