Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

DOI10.1137/0221011zbMath0743.68074OpenAlexW1977741646MaRDI QIDQ3990106

Andrew V. Goldberg, David B. Shmoys, Éva Tardos, Serge A. Plotkin

Publication date: 28 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5246083cd4f32d88f526efdad84d1408251d4921

zbMATH Keywords

linear programmingparallel algorithmsinterior-point methodsbipartite matchingCRCW PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ Towards auction algorithms for large dense assignment problems ⋮ Planar graphs, negative weight edges, shortest paths, and near linear time ⋮ A sublinear parallel algorithm for stable matching

This page was built for publication: Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems