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

Publication  Article, peer reviewed scientific 
Title  A Fast Parallel Algorithm for MinimumCost Small Integral Flows 
Author(s)  Lingas, Andrzej ; Persson, Mia 
Date  2015 
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 multivariate 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)+log(2)(kn)) time and using 2 (k) (kn) (O(1)) processors. Thus, in particular, for the minimumcost flow of value O(logn), we obtain an RNC2 algorithm, improving upon time complexity of earlier NC and RNC algorithms.  
DOI  http://dx.doi.org/10.1007/s0045301398651 (link to publisher's fulltext) 
Publisher  Springer 
Host/Issue  Algorithmica;2 
Volume  72 
ISSN  01784617 
Pages  607619 
Language  eng (iso) 
Subject(s)  Maximum integral flow Minimumcost flow Polynomial verification Parallel algorithms Randomized algorithms Time complexity Processor complexity Technology Research Subject Categories::TECHNOLOGY 
Handle  http://hdl.handle.net/2043/20002 (link to this page) 