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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 04, 2017, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Malte Milatz

Linear Programs, Violators, and Random Walks

Violator spaces are a very general framework for the analysis of linear programs and related optimization problems. We define the closely related, but simpler, notion of "violator graphs". We use violator graphs to close a gap between the known bounds for the number of violator spaces. We go on to generalize a fixed-dimension lower bound for an optimizing random walk to the setting of violator graphs.

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

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