Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Monday, September 11, 2017, 12:15 pm
Duration: 30 minutes
Location: CAB G11
Speaker: Haris Angelidakis (Toyota Technological Institute at Chicago)
We study a beyond-worst-case-analysis framework known as stability and perturbation resilience, introduced by Bilu and Linial (2010) and Awasthi, Blum, and Sheffet (2012). A combinatorial optimization problem is $\alpha$-stable or $\alpha$-perturbation-resilient if the optimal solution does not change when we perturb all parameters of the problem by a factor of at most $\alpha$. We present improved algorithms for stable instances of clustering problems, such as k-means and k-median, and also give improved algorithms for stable instances of Minimum Multiway Cut. We conclude with several hardness results for stable instances of covering problems. Based on joint work with Konstantin Makarychev and Yury Makarychev.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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