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

SIAM Journal on Computing - United States
doi 10.1137/0221011
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

Interior-Point Algorithms, Penalty Methods and Equilibrium Problems

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2006English

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2000English

Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

Journal of Algorithms
1993English

Fast Algorithms for Parallel Architectures

1990English

Round Compression for Parallel Matching Algorithms

2018English

Matching-Based Preprocessing Algorithms to the Solution of Saddle-Point Problems in Large-Scale Nonconvex Interior-Point Optimization

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2007English

Fast Algorithms for Approximate Circular String Matching

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2014English

Parallel Remapping Algorithms for Adaptive Problems

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy