Interior-point methods in parallel computation

Authors:
Andrew V. Goldberg;Serge A. Plotkin;David B. Shmoys;Eva Tardos
Affiliations:
-;-;-;-
Venue:
Interior-point methods in parallel computation
Year:
1989

Citing 0
Cited 1

Fast parallel matching in expander graphs

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.01

Visualization

Abstract

ln this paper we use interior-point methods for linear programing, developed in the context of sequential computation, to obtain a parallel algorithm for the bipartite matching problem. Our algorithm runs in $O^n$(SQRT m) time. Our results extend to the weighted bipartite matching problem and to the zero-one minimum-cost flow problem, yielding $O^n$((SQRT m) log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interior-point methods in the context of parallel algorithm design.