It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...