Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
暂无分享,去创建一个
[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[2] Victor Y. Pan,et al. Efficient parallel solution of linear systems , 1985, STOC '85.
[3] Leslie G. Valiant,et al. A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.
[4] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[5] M. Todd,et al. Recent Developments and New Directions in Linear Programming , 1988 .
[6] Uzi Vishkin,et al. Constant Depth Reducibility , 1984, SIAM J. Comput..
[7] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[8] Bruno Codenotti. Parallel solution of linear systems by repeated squaring , 1990 .
[9] Andrew V. Goldberg,et al. Sublinear-Time Parallel Algorithms for Matching and Related Problems , 1993, J. Algorithms.
[10] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[11] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.
[12] R. C. Monteiro,et al. Interior path following primal-dual algorithms , 1988 .
[13] Bruce M. Maggs,et al. Communication-Efficient Parallel Graph Algorithms , 1986, ICPP.
[14] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[15] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..