193 search results - page 38 / 39 » The Capacitated m-Ring-Star Problem |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
PE
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
IEICET
2007
13 years 7 months ago
2007
The comb capacitor models based on the measurement is reported. However, there are a problem of not scalable model and not corresponding to the millimeter wave and the sub millimet...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
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 ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...