Resultats globals: 1 registres trobats en 0.02 segons.
Articles, 1 registres trobats
Articles 1 registres trobats  
1.
16 p, 827.8 KB Fast deterministic approximation for the multicommodity flow problem / Radzik, Tomasz
In this paper we consider an optimization version of the multicommodity flow problem which is known as the maximum concurrent flow problem. We show that an approximate solution to this problem can be computed deterministically using O (k((Epsilon)^-2 + log k) log n) 1-commodity minimum-cost flow computations, where k is the number of commodities, n is the number of nodes, and (Epsilon) is the desired precision. [...]
1997
Mathematical Programming, vol. 78 n. 1 (1997) p. 43-58  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.