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, November 14, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Daan Nilis

A Massively Parallel Algorithm for Minimum Weight Vertex Cover

We present an algorithm to find a (2+\epsilon)-approximate minimum weight vertex cover in the Massively Parallel Computation model where each machine has near linear memory w.r.t. the number of vertices in the graph. Our algorithm has a round complexity of O(log log d) where d is the average degree of the graph. This result indicates that the weighted version can be solved as fast as the unweighted version by Ghaffari et al. [PODC’18]. Joint work with Mohsen Ghaffari.

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