Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...