On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems.

Jrme Monnot

Browse the full ISAAC paper archive.