Monnot Jerome

Jerome Monnot

Information about the author Jerome Monnot will soon be added to the site.
Found 1 papers in total
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
2008
In this note, we strengthen the inapproximation bound of O(log n ) for the labeled...
Papers per page: