Results 171 to 180 of about 957 (221)

Bilateral Trade Welfare Impacts of India's Export Ban of Non-Basmati Rice Using the Global Partial Equilibrium Simulation Model (GSIM). [PDF]

Foods
Fathelrahman E, Osman R, Hoag DLK, Sixt GN, Strzepek K.   +4 more
europepmc   +1 more source

The concept of optimal planning of a linearly oriented segment of the 5G network. [PDF]

PLoS One
Kovtun V, Grochla K, Zaitseva E, Levashenko V.   +3 more
europepmc   +1 more source

Current and future directions in network biology. [PDF]

Bioinform Adv
Zitnik M, Li MM, Wells A, Glass K, Morselli Gysi D, Krishnan A, Murali TM, Radivojac P, Roy S, Baudot A, Bozdag S, Chen DZ, Cowen L, Devkota K, Gitter A, Gosline SJC, Gu P, Guzzi PH, Huang H, Jiang M, Kesimoglu ZN, Koyuturk M, Ma J, Pico AR, Pržulj N, Przytycka TM, Raphael BJ, Ritz A, Sharan R, Shen Y, Singh M, Slonim DK, Tong H, Yang XH, Yoon BJ, Yu H, Milenković T.   +36 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Hypercubes and Multicommodity Flows

SIAM Journal on Discrete Mathematics, 1997
Summary: The average degree of a subgraph \(H\) of the \(r\)-dimensional hypercube \(Q_r\) equals at most the maximum Hamming distance of any two nodes in \(H\). A corollary is that the minimum number of edges to delete from \(Q_r\) such that any two nodes at Hamming distance \(\ell\) are separated is \((r+1-\ell) 2^{r-1}\).
Bo Yu 0001, Joseph Cheriyan, Penny E. Haxell   +2 more
openaire   +2 more sources

Multicommodity Flows in Ring Networks

INFORMS Journal on Computing, 1996
In this paper, we consider the problem of multicommodity flows in a ring network. Using necessary and sufficient conditions to ensure feasible linear and integral flows in the network, and the special structure of the ring topology, we construct efficient algorithms to route all the demands.
Rita Vachani, Alexander Shulman, Peter Kubat, Julie Ward   +3 more
openaire   +1 more source

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

SIAM Journal on Discrete Mathematics, 2000
. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of ...
Lisa K. Fleischer
exaly   +1 more source

The stochastic multicommodity flow problem

Networks, 1990
AbstractThis paper formulates and classifies some multicommodity flow problems (MFP) on “stochastic networks.” Here, the arc attributes are not necessarily deterministic, but, rather, are allowed to be probabilistic. Some special cases of the stochastic multicommodity flow problems (SMFP) are considered where the resultant formulations are solvable by ...
Hossein Soroush, Pitu B. Mirchandani
openaire   +1 more source

Approximation through multicommodity flow

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 2002
The first approximate max-flow-min-cut theorem for general multicommodity flow is proved. It is used to obtain approximation algorithms for minimum deletion of clauses of a 2-CNF identical to formula, via minimization problems, and other problems. Also presented are approximation algorithms for chordalization of a graph and for register sufficiency ...
Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao   +3 more
openaire   +1 more source

A multicommodity flow problem

Networks, 1974
AbstractThis paper presents an algorithm for finding maximal sized sets of flows in a certain class of multicommodity flow networks. The class consists of networks with integer capacity edges and with each node being a source or sink for all but at most one commodity.
openaire   +2 more sources