Approximating Matchings in Parallel bY

Abstract

We show that for any constant k > 0, a matching with cardinality at least 1 & times the maximum can be computed in NC.

Extracted Key Phrases

Cite this paper

@inproceedings{Fischer1998ApproximatingMI, title={Approximating Matchings in Parallel bY}, author={Ted Fischer and Andrew V. Goldberg and Serge A. Plotkin}, year={1998} }