A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows

DSpace Repository

A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows

Show full item record

Files for download

Find Full text There are no files associated with this item.


Simple item record

Publication Conference Paper, peer reviewed
Title A Fast Parallel Algorithm for Minimum-Cost 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 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
Pages 688-699
Language eng (iso)
Subject(s) minimum-cost flow
polynomial verification
Research Subject Categories::TECHNOLOGY
Note Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012.
Handle http://hdl.handle.net/2043/15406 (link to this page)
Link http://europar2012.cti.gr/ (external link to related web page)

This item appears in the following Collection(s)

Show full item record



My Account