Utskrift från Malmö universitet - mau.se
Utskrift från Malmö universitet - mau.se
Publication | Conference Paper, peer reviewed |
Title | A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows |
Author | Lingas, Andrzej ; Persson, Mia |
Editor | Kaklamanis, Christos ; Papatheodorou, Theodore ; Spirakis, Paul G. |
Date | 2012 |
English abstract | |
We present a new approach to the minimum-cost integral flow problem for small values of the flow. It reduces the problem to the tests of simple multi-variable polynomials over a finite field of characteristic two for non-identity with zero. In effect, we show that a minimum-cost 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 minimum-cost flow of value O(logn), we obtain an RNC 2 algorithm. | |
Publisher | Springer |
Host/Issue | Euro-Par 2012 Parallel Processing; |
Series/Issue | Lecture Notes in Computer Science;7484 |
ISSN | 0302-9743 |
ISBN | 978-3-642-32819-0 9783642328206 |
Pages | 688-699 |
Language | eng (iso) |
Subject | minimum-cost flow RNC polynomial verification Sciences Research Subject Categories::TECHNOLOGY |
Note | Euro-Par 2012 Parallel Processing - 18th International Conference, Eur... (see Details for more) |
Handle | http://hdl.handle.net/2043/15406 Permalink to this page |
Link | http://europar2012.cti.gr/... (external link to related web page) |
Tweet |