Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.
Andrew V. GoldbergSerge A. PlotkinDavid B. ShmoysÉva TardosPublished in: SIAM J. Comput. (1992)
Keyphrases
- parallel algorithm
- related problems
- interior point methods
- bipartite matching
- convex optimization
- linear program
- semidefinite programming
- linear programming
- quadratic programming
- maximum weight
- primal dual
- minimum cost flow
- interior point
- solving problems
- computationally intensive
- learning algorithm
- data points
- np hard
- objective function
- reinforcement learning