Utskrift från Malmö högskola  mah.se
Utskrift från Malmö högskola  mah.se
Tweet

Publication  Conference Paper, peer reviewed 
Title  A Fast Parallel Algorithm for MinimumCost Small Integral Flows 
Author(s)  Lingas, Andrzej ; Persson, Mia 
Date  2012 
Editor(s)  Kaklamanis, Christos; Papatheodorou, Theodore; Spirakis, Paul G. 
English abstract  
We present a new approach to the minimumcost integral flow problem for small values of the flow. It reduces the problem to the tests of simple multivariable polynomials over a finite field of characteristic two for nonidentity with zero. In effect, we show that a minimumcost flow of value k in a network with n vertices, a sink and a source, integral edge capacities and positive integral edge costs polynomially bounded in n can be found by a randomized PRAM, with errors of exponentially small probability in n, running in O(klog(kn) + log2 (kn)) time and using 2 k (kn) O(1) processors. Thus, in particular, for the minimumcost flow of value O(logn), we obtain an RNC 2 algorithm.  
Publisher  Springer 
Host/Issue  EuroPar 2012 Parallel Processing; 
Series/Issue  Lecture Notes in Computer Science;7484 
ISSN  03029743 
ISBN  9783642328190 9783642328206 
Pages  688699 
Language  eng (iso) 
Subject(s)  minimumcost flow RNC polynomial verification Sciences Research Subject Categories::TECHNOLOGY 
Note  EuroPar 2012 Parallel Processing  18th International Conference, EuroPar 2012, Rhodes Island, Greece, August 2731, 2012. 
Handle  http://hdl.handle.net/2043/15406 (link to this page) 
Link  http://europar2012.cti.gr/ (external link to related web page) 