Abstract
We show here that the general Maximum Flow problem can be approximated by a RNC algorithm in such a way that for any fixed (or at most polynomially bounded) ε, the absolute performance ratio is at most 1+1/ε. Our results furthermore imply that there is a fully NC approximation scheme for the Maximum Flow problem if and only if there is an algorithm in NC to construct a Maximum Matching in a bipartite graph.
This research was done during the visit of the first author to Patras University, and it is supported by a Spanish Research Scholarship, by the Ministry of Industry, Energy and Technology of Greece and by the ESPRIT II Basic Research Actions Program of the EC under contract No. 3075 (project ALCOM)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. J. Anderson and E. W. Mayr. Approximating P-complete problems. Technical report, Stanford University, 1986.
S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.
S. Even. Graph Algorithms. Pitman, London, 1979.
M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, 1979.
L. M. Goldschlager, R. A. Shaw, and J. Staples. The maximum flow problem is log space complete for P. Theoretical Computer Science, 21:105–111, 1982.
D. B. Johnson and S. M. Venkatesan. Parallel algorithms for minimum cuts and maximum flows in planar networks. Journal of the ACM, pages 950–967, 1987.
H. J. Karloff. A las Vegas RNC algorithm for maximum matching. Combinatorica, 6:387–392, 1986.
R. M. Karp, E. Upfal, and A. Wigderson. Constructing a perfect matching is in Random NC. In 17th Annual ACM Symposium on Theory of Computing, pages 22–32, 1985. Also Combinatorica 6:35–48, 1986.
L. Kirousis, M. Serna, and P. Spirakis. The parallel complexity of the subgraph connectivity problem. In 30th Annual IEEE Symposium on Foundations of Computer Science, pages 294–299, 1989.
E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.
K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. Matching is as easy as matrix inversion. In 19th Annual ACM Symposium on Theory of Computing, pages 345–354, 1987.
M. Serna and P. Spirakis. The approximability of problems complete for P. In International Symposium on Optimal Algorithms, volume 401 of Lecture Notes in Computer Science, pages 193–204. Springer-Verlag, 1989.
M. Serna and P. Spirakis. Applying P-completeness to approximation problems. Technical Report 90.05.14, CTI, Patras University, 1990. Algorithms Review to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Serna, M., Spirakis, P. (1991). Tight RNC approximations to Max Flow. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020792
Download citation
DOI: https://doi.org/10.1007/BFb0020792
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive