Software Defined Networks (SDNs) are becoming the leading technology behind many
traffic engineering solutions, both for backbone and data-center networks, since it allows a …

Many practically deployed flow algorithms produce the output as a set of values associated
with the network links. However, to actually deploy a flow in a network we often need to …

Given a graph and terminal pairs (s_i,t_i), i∈k, the edge-disjoint paths problem is to
determine whether there exist s_it_i paths, i∈k, that do not share any edges. We consider …

We consider the unsplittable flow problem (UFP) and the closely related column-restricted
packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G=(V, E) …

We study the maximum edge-disjoint paths problem in undirected planar graphs: given a
graph G and node pairs s1t1, s2t2,..., sktk, the goal is to maximize the number of pairs that …

We consider the problem of scheduling a set of jobs on a system that offers certain resource,
wherein the amount of resource offered varies over time. For each job, the input specifies a …

Given a graph and pairs siti of terminals, the edge-disjoint paths problem is to determine
whether there exist siti paths that do not share any edges. We consider this problem on …

There exists a wide variety of network problems where several connection requests occur
simultaneously. In general, each request is attended by finding a route in the network, where …

We examine a new approach to finding efficient routing paths in large networks (eg inter-
datacenter networks). Such networks carry many simultaneous data transmissions and …

Optimization problems concerning edge-disjoint paths have attracted considerable attention
for decades. These problems have a lot of applications in the areas of call admission control …