Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

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

Mittagsseminar Talk Information

Date and Time: Thursday, September 21, 2023, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Anita Dürr

Approximating Exact Matching in bipartite graph

In the Exact Matching problem, one is given a graph with red and blue edges and an integer k. The goal is to determine whether the graph admits a perfect matching with exactly k red edges. A few years after its introduction in 1982 by Papadimitriou and Yannakakis, Mulmuley et al. showed a randomized algorithm solving Exact Matching, making it a member of the class RP. Determining whether Exact Matching is in P remains an open problem and very little progress has been made in that direction. In this talk I will focus on approximation algorithms that compute perfect matchings with almost k red edges and show the first one-sided approximation algorithm of that sort.

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

Previous talks by year:   2024  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