Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, May 11, 2023, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Saeed Ilchi
Given a collection of sets, the hitting set problem asks for finding a small set that contains at least one element from each set in the collection. This problem appears as a subproblem in various contexts, and the standard randomized algorithm of sampling each element with a high enough probability is effective for several applications. We design an efficient derandomization for this sampling procedure, leading to closing the gap between the randomized and deterministic results for several problems.
This is based on a joint work with Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, and Václav Rozhoň: https://arxiv.org/abs/2209.11669
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