Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests
We study traffic grooming in optical network design. The goal is to aggregate low-bandwidth traffic streams to efficiently utilize high-bandwidth media such as wavelength channels.
We consider approximation algorithms for non-uniform buy-at- bulk network design problems, in particular the multicommodity version.
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems.
In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world.
The covering Steiner problem is a common generalization of the kappa-MST and the group Steiner problems: given an edge-weighted graph, with subsets of vertices called the groups, and a nonnegative
We study the Edge-Disjoint Paths with Congestion (EDPwC) problem in undirected networks in which we must integrally route a set of demands without causing large congestion on an edge.
Distributed cloud networking builds on network functions virtualization (NFV) and software defined networking (SDN) to enable the deployment of network services in the form of elastic virtual netwo
We give an O(D/a log n)-approximation algorithm for the Uniform Capacity Unsplittable Flow Problem (UCUFP) with weights, on an expander with degree D and expansion a.
Model reduction, parameter uncertainties and state estimation in spatiotemporal problems induced by chaotic partial differential equations is considered.
