A sublinear parallel algorithm for stable matching
From MaRDI portal
Publication:1575960
DOI10.1016/S0304-3975(99)00125-5zbMath0961.90088MaRDI QIDQ1575960
Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
linear programming; parallel algorithm; stable matching; nonexpansive circuits; primal-dual interior path-following method
90C60: Abstract computational complexity for mathematical programming problems
90C05: Linear programming
90C51: Interior-point methods
90C27: Combinatorial optimization
68W10: Parallel algorithms in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- The complexity of circuit value and network stability
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
- A New Approach to Stable Matching Problems