Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, October 25, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Nicolas El Maalouly

Approximation Algorithms for the Exact Matching Problem

In the Exact Matching problem, we are given a graph with edges colored red and blue, and an integer k. The goal is to output a perfect matching with exactly k red edges. After introducing the problem in 1982, Papadimitriou and Yannakakis conjectured it to be NP-hard. Soon after, however, Mulmuley et al. (1987) proved that it can be solved in randomized polynomial time, which makes it unlikely to be NP-hard. Determining whether Exact Matching is in P remains an open problem and very little progress has been made towards that goal. Yuster (2012) showed that relaxing the perfect matching constraint by even one edge results in a simple deterministic polynomial-time algorithm. Generalisations of the problem have been well studied in the literature. Such generalisations include Bounded Color Matchings, where we have multiple color constraints, and Budgeted Matchings, where the color constraints (i.e. cardinality constraints) are replaced by budget constrains. Approximation algorithms have been studied for these problems, but none of the prior results work when enforcing a perfect matching constraint. In this talk I show how we can transform the Exact Matching problem into an optimization problem while keeping the perfect matching requirement and then present approximation algorithms for it.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login