BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-91-1369
       ENTRY:: September 02, 1994
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Approximating matchings in parallel
        TYPE:: Technical Report
      AUTHOR:: Fischer, Ted
      AUTHOR:: Goldberg, Andrew V.
      AUTHOR:: Plotkin, Serge
        DATE:: June 1991
       PAGES:: 8
    ABSTRACT:: We show that for any constant k > O, a matching with
               cardinality at least 1 - 1/(k+1) times the maximum can be
               computed in NC.
       NOTES:: [Adminitrivia V1/RAM/19940902]
         END:: STAN//CS-TR-91-1369