Exact Matching and the Top-k Perfect Matching Problem

09/17/2022
by   Nicolas El Maalouly, et al.
0

The aim of this note is to provide a reduction of the Exact Matching problem to the Top-k Perfect Matching Problem. Together with earlier work by El Maalouly, this shows that the two problems are polynomial-time equivalent. The Exact Matching Problem is a well-known 40 years old problem for which a randomized, but no deterministic poly-time algorithm has been discovered. The Top-k Perfect Matching Problem is the problem of finding a perfect matching which maximizes the total weight of the k heaviest edges contained in it.

READ FULL TEXT

page 1

page 2

research
07/05/2023

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs

In 1982 Papadimitriou and Yannakakis introduced the Exact Matching probl...
research
07/20/2022

Exact Matching: Correct Parity and FPT Parameterized by Independence Number

Given an integer k and a graph where every edge is colored either red or...
research
11/16/2022

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity

Given a graph with edges colored red or blue and an integer k, the exact...
research
02/02/2022

Matching Orderable and Separable Hypergraphs

A perfect matching in a hypergraph is a set of edges that partition the ...
research
10/23/2022

Finding matchings in dense hypergraphs

We consider the algorithmic decision problem that takes as input an n-ve...
research
03/25/2022

Exact Matching: Algorithms and Related Problems

In 1982, Papadimitriou and Yannakakis introduced the Exact Matching (EM)...
research
10/25/2022

A distributed blossom algorithm for minimum-weight perfect matching

We describe a distributed, asynchronous variant of Edmonds's exact algor...

Please sign up or login with your details

Forgot password? Click here to reset