论文信息 - Approximating the Minimum-Cost Maximum Flow is P-Complete - 字舞流文

Approximating the Minimum-Cost Maximum Flow is P-Complete

Abstract We show that it is impossible, in NC, to approximate the value of the minimum-cost maximum flow unless P = NC.

Clifford Stein | Joel Wein | C. Stein | J. Wein

[1] P. Spirakis,et al. The parallel complexity of the subgraph connectivity problem , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2] Paul G. Spirakis,et al. Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P , 1988, SWAT.

[3] Richard J. Anderson,et al. A P-complete problem and approximations to it , 1984 .

[4] Paul G. Spirakis,et al. The Approximability of Problems Complete for P , 1989, Optimal Algorithms.

[5] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[6] Maria J. Serna,et al. Approximating Linear Programming is Log-Space Complete for P , 1991, Inf. Process. Lett..

[7] Paul G. Spirakis,et al. Tight RNC Approximations to Max Flow , 1991, STACS.

[8] John Staples,et al. The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[9] Jan van Leeuwen,et al. Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .