2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1989)

Research Triangle Park, NC, USA

Oct. 30, 1989 to Nov. 1, 1989

ISBN: 0-8186-1982-1

pp: 350-355

A.V. Goldberg , Stanford Univ, CA, USA

ABSTRACT

Interior-point methods for linear programming, developed in the context of sequential computation, are used to obtain a parallel algorithm for the bipartite matching problem. The algorithm runs in O*( square root m) time. The results extend to the weighted bipartite matching problem and to the zero-one minimum-cost flow problem, yielding O*( square root m log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interior-point methods in parallel algorithm design.

INDEX TERMS

interior-point methods, linear programming, parallel algorithm, bipartite matching problem

CITATION

E. Tardos,
S.A. Plotkin,
D.B. Shmoys,
A.V. Goldberg,
"Interior-point methods in parallel computation",

*2013 IEEE 54th Annual Symposium on Foundations of Computer Science*, vol. 00, no. , pp. 350-355, 1989, doi:10.1109/SFCS.1989.63502SEARCH